Fixed topology alignment with recombination
From MaRDI portal
Publication:1585336
DOI10.1016/S0166-218X(00)00196-7zbMath0965.92022MaRDI QIDQ1585336
Publication date: 6 November 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
approximation algorithm; multiple sequence alignment; phylogeny; recombination; computational biology; PTAS; evolutionary tree; polynomial time approximation scheme
92C40: Biochemistry, molecular biology
92D20: Protein sequences, DNA sequences
65Y20: Complexity and performance of numerical algorithms
92-08: Computational methods for problems pertaining to biology
Related Items
Optimal algorithms for recombination distance problem, All that glisters is not galled, Fixed topology alignment with recombination
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstructing evolution of sequences subject to recombination using parsimony
- On the linear-cost subtree-transfer distance between phylogenetic trees
- Reconstructing a history of recombinations from a set of sequences
- Fixed topology alignment with recombination
- Approximation algorithms for tree alignment with a given phylogeny
- Trees, Stars, and Multiple Biological Sequence Alignment
- Minimal Mutation Trees of Sequences
- Algorithms on Strings, Trees and Sequences
- Improved Approximation Algorithms for Tree Alignment
- A More Efficient Approximation Scheme for Tree Alignment
- On the complexity of comparing evolutionary trees
