Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Haplotyping as perfect phylogeny: conceptual framework and efficient solutions
Proceedings of the sixth annual international conference on Computational biology
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Large scale reconstruction of haplotypes from genotype data
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Efficient rule-based haplotyping algorithms for pedigree data
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
A note on the single genotype resolution problem
Journal of Computer Science and Technology
An Efficient Algorithm for Perfect Phylogeny Haplotyping
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
The phasing of heterozygous traits: Algorithms and complexity
Computers & Mathematics with Applications
Experimental analysis of a new algorithm for partial haplotype completion
International Journal of Bioinformatics Research and Applications
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A new preprocessing procedure for the haplotype inference problem
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Algorithm for haplotype inferring via galled-tree networks with simple galls
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
The longest haplotype reconstruction problem revisited
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A Class Representative Model for Pure Parsimony Haplotyping
INFORMS Journal on Computing
A practical parameterized algorithm for the individual haplotyping problem MLF
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A combination of PSO and K-means methods to solve haplotype reconstruction problem
IIT'09 Proceedings of the 6th international conference on Innovations in information technology
Natural Computing: an international journal
Haplotype inference on pedigrees with recombinations and mutations
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
A practical parameterised algorithm for the individual haplotyping problem mlf†
Mathematical Structures in Computer Science
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
On the complexity of several haplotyping problems
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
A linear-time algorithm for the perfect phylogeny haplotyping (PPH) problem
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Experimental analysis of a new algorithm for partial haplotype completion
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
New results for the Longest Haplotype Reconstruction problem
Discrete Applied Mathematics
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Solving VLSI design and DNA sequencing problems using bipartization of graphs
Computational Optimization and Applications
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
FNphasing: A Novel Fast Heuristic Algorithm for Haplotype Phasing Based on Flow Network Model
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Hi-index | 0.00 |
The investigation of genetic differences among humans has given evidence that mutations in DNA sequences are responsible for some genetic diseases. The most common mutation is the one that involves only a single nucleotide of the DNA sequence, which is called a single nucleotide polymorphism (SNP). As a consequence, computing a complete map of all SNPs occurring in the human populations is one of the primary goals of recent studies in human genomics. The construction of such a map requires to determine the DNA sequences that from all chromosomes. In diploid organisms like humans, each chromosome consists of two sequences called haplotypes. Distinguishing the information contained in both haplotypes when analyzing chromosome sequences poses several new computational issues which collectively form a new emerging topic of Computational Biology known as Haplotyping.This paper is a comprehensive study of some new combinatorial approaches proposed in this research area and it mainly focuses on the formulations and algorithmic solutions of some basic biological problems. Three statistical approaches are briefly discussed at the end of the paper.