Reconstructing a history of recombinations from a set of sequences
From MaRDI portal
Publication:1281773
DOI10.1016/S0166-218X(98)00074-2zbMath0927.68025MaRDI QIDQ1281773
Dan Gusfield, John D. Kececioglu
Publication date: 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (7)
Unnamed Item ⋮ On recognising words that are squares for the shuffle product ⋮ Optimal algorithms for recombination distance problem ⋮ A DISCRIMINATION MEASURE FOR PHYLOGENETIC TREE CONSTRUCTION ⋮ The Shuffle Product: New Research Directions ⋮ MINIMUM MOSAIC INFERENCE OF A SET OF RECOMBINANTS ⋮ Fixed topology alignment with recombination
Cites Work
- Reconstructing evolution of sequences subject to recombination using parsimony
- On the complexity of iterated shuffle
- Dynamic maintenance of directed hypergraphs
- The use of sample genealogies for studying a selectively neutral m-loci model with recombination
- Sequence comparison with concave weighting functions
- Speeding up dynamic programming with applications to molecular biology
- An algorithm for a merge recognition problem
- On the computational complexity of a merge recognition problem
- Properties of a neutral allele model with intragenic recombination
- A robust model for finding optimal evolutionary tree
- Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
- Minimal Representation of Directed Hypergraphs
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- Evolutionary trees and admixture: phylogenetic inference when some populations are hybridized
- An Extension of the String-to-String Correction Problem
- A linear space algorithm for computing maximal common subsequences
- Inferring Evolutionary History From DNA Sequences
- Genome Rearrangements and Sorting by Reversals
- Fibonacci heaps and their uses in improved network optimization algorithms
- On the hardness of approximating minimization problems
- Efficient probabilistically checkable proofs and applications to approximations
- Efficient algorithms for inferring evolutionary trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Reconstructing a history of recombinations from a set of sequences