ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations (Q3506937): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in Computational Molecular Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fine Structure of Galls in Phylogenetic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants / rank
 
Normal rank

Latest revision as of 12:10, 28 June 2024

scientific article
Language Label Description Also known as
English
ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations
scientific article

    Statements