Reconstructing a history of recombinations from a set of sequences
Authors:
- John KececiogluJKJohn Kececioglu
- Dan GusfieldDGDan Gusfield
- 1 November 1998
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 88 (1-3) , 239-260
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A robust model for finding optimal evolutionary treesAlgorithmica, 1995
- A heuristic method to reconstruct the history of sequences subject to recombinationJournal of Molecular Evolution, 1993
- Efficient algorithms for inferring evolutionary treesNetworks, 1991
- Dynamic maintenance of directed hypergraphsTheoretical Computer Science, 1990
- Reconstructing evolution of sequences subject to recombination using parsimonyMathematical Biosciences, 1990
- Speeding up dynamic programming with applications to molecular biologyTheoretical Computer Science, 1989
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987
- Minimal Representation of Directed HypergraphsSIAM Journal on Computing, 1986
- Properties of a neutral allele model with intragenic recombinationTheoretical Population Biology, 1983
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975