Methods for reconstructing the history of tandem repeats and their application to the human genome.

DOI10.1016/S0022-0000(02)00006-5zbMath1058.68530MaRDI QIDQ1872719

Deep Jaitly, Bin Ma, Guo-Hui Lin, Paul E. Kearney

Publication date: 14 May 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10)

Related Items (2)

Approximation algorithms for reconstructing the duplication history of tandem repeats ⋮ An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees

Cites Work

• The Steiner problem with edge lengths 1 and 2
• Optimization, approximation, and complexity classes
• Approximation algorithms for tree alignment with a given phylogeny
• Minimal Mutation Trees of Sequences
• A More Efficient Approximation Scheme for Tree Alignment

This page was built for publication: Methods for reconstructing the history of tandem repeats and their application to the human genome.