Efficient Algorithms for SNP Haplotype Block Selection Problems

DOI10.1007/978-3-540-69733-6_31zbMath1148.92301OpenAlexW1597625225MaRDI QIDQ3511342

Yaw-Ling Lin

Publication date: 10 July 2008

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-69733-6_31

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Biochemistry, molecular biology (92C40)

Cites Work

• On-line construction of suffix trees
• An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
• Fast Algorithms for Finding Nearest Common Ancestors
• Algorithms on Strings, Trees and Sequences

This page was built for publication: Efficient Algorithms for SNP Haplotype Block Selection Problems