An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study (Q876478): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dean R. Hickerson / rank
Normal rank
 
Property / author
 
Property / author: Dean R. Hickerson / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2005.05.044 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033833391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in Computational Molecular Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for inferring evolutionary trees / rank
 
Normal rank
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: Reconstructing evolution of sequences subject to recombination using parsimony / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5456778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum number of recombination events in the evolutionary history of DNA se\-quences / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:39, 25 June 2024

scientific article
Language Label Description Also known as
English
An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
scientific article

    Statements

    An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study (English)
    0 references
    0 references
    0 references
    0 references
    18 April 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    molecular evolution
    0 references
    phylogenetic networks
    0 references
    ancestral recombination graph
    0 references
    recombination
    0 references
    hybridization
    0 references
    SNP
    0 references
    0 references