Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats

DOI10.1007/978-3-540-73545-8_48MaRDI QIDQ3608873zbMATH OpenOpenAlexFDO

Authors Lusheng Wang, Zhanyong Wang, Zhi-Zhong Chen

Publication date 6 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73545-8_48

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• Approximation algorithms for reconstructing the duplication history of tandem repeats
• Methods for reconstructing the history of tandem repeats and their application to the human genome.
• A SURVEY ON ALGORITHMIC ASPECTS OF TANDEM REPEATS EVOLUTION
• scientific article; zbMATH DE number 1945157
• An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees

Cited in

(7)

• The Tandem Duplication Distance Is NP-Hard
• A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences
• scientific article; zbMATH DE number 1945157 (Why is no real title available?)
• The combinatorics of tandem duplication
• Methods for reconstructing the history of tandem repeats and their application to the human genome.
• Approximation algorithms for reconstructing the duplication history of tandem repeats
• Efficient algorithms for identifying orthologous simple sequence repeats of disease genes

This page was built for publication: Approximation Algorithms for Reconstructing the Duplication History of Tandem Repeats

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608873)