The haplotyping problem: an overview of computational models and solutions

DOI10.1007/BF02945456zbMath1083.68579MaRDI QIDQ1884294

Riccardo Dondi, Gianluca Della Vedova, Jing Li, Paola Bonizzoni

Publication date: 28 October 2004

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

haplotypesbioinformaticscombinatorial algorithms

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10)

Related Items (10)

New results for the longest haplotype reconstruction problem ⋮ Solving VLSI design and DNA sequencing problems using bipartization of graphs ⋮ The pure parsimony haplotyping problem: overview and computational advances ⋮ Particle swarm optimization for SNP haplotype reconstruction problem ⋮ Clique-detection models in computational biochemistry and genomics ⋮ Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics ⋮ A practical parameterised algorithm for the individual haplotyping problem MLF ⋮ The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification ⋮ A colored graph approach to perfect phylogeny with persistent characters ⋮ Beyond evolutionary trees

Cites Work

• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Algorithms on Strings, Trees and Sequences
• A dynamic programming algorithm for haplotype block partitioning
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The haplotyping problem: an overview of computational models and solutions