On the minimum number of topologies explaining a sample of DNA sequences

Theoretical Population Biology

Volumn 62, Issue 4, 2002, Pages 357-363

  Wiuf, Carsten ^a  

^a Variagenics   (United States)

Author keywords

Algorithm; Recombination; SNP; Topology

Indexed keywords

ALGORITHM; DNA; POPULATION GENETICS; RECOMBINATION; TOPOLOGY;

DNA;

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; DNA SEQUENCE; GENETIC RECOMBINATION; GENETICS;

ALGORITHMS; DNA; MODELS, GENETIC; RECOMBINATION, GENETIC; SEQUENCE ANALYSIS, DNA;

EID: 0036885956     PISSN: 00405809     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0040-5809(02)00004-7     Document Type: Article

References (5)

1. Allen B., Steel M. Subtree transfer operations and their induced metrics on evolutionary trees. Ann. Comb. 5:2001;1-13.
2. Estabrook G., Johnson C., McMorris F. An idealized concept of the true cladistic character. Math. Biosc. 23:1975;263-272.
3. Gusfield D. Efficient algorithms for inferring evolutionary trees. Networks. 21:1991;19-28.
4. Hudson R.R., Kaplan N. Statistical properties of the number of recombination events in the history of a sample of DNA sequences. Genetics. 111:1985;147-165.
5. Myers, S., 2002. Bounds on the minimum number of recombination events in a sample history, Genetics to appear.