Haplotype‐association analysis

N Liu, K Zhang, H Zhao - Advances in genetics, 2008 - Elsevier
Association methods based on linkage disequilibrium (LD) offer a promising approach for
detecting genetic variations that are responsible for complex human diseases. Although …

The haplotyping problem: an overview of computational models and solutions

P Bonizzoni, G Della Vedova, R Dondi, J Li - Journal of Computer Science …, 2003 - Springer
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 …

[图书][B] Handbook of computational molecular biology

S Aluru - 2005 - taylorfrancis.com
The enormous complexity of biological systems at the molecular level must be answered
with powerful computational methods. Computational biology is a young field, but has seen …

Parameterized algorithms in bioinformatics: an overview

L Bulteau, M Weller - Algorithms, 2019 - mdpi.com
Bioinformatics regularly poses new challenges to algorithm engineers and theoretical
computer scientists. This work surveys recent developments of parameterized algorithms …

Integer programming approaches to haplotype inference by pure parsimony

DG Brown, IM Harrower - IEEE/ACM Transactions on …, 2006 - ieeexplore.ieee.org
In 2003, Gusfield introduced the haplotype inference by pure parsimony (HIPP) problem and
presented an integer program (IP) that quickly solved many simulated instances of the …

Models and algorithms for haplotyping problem

XS Zhang, RS Wang, LY Wu, L Chen - Current Bioinformatics, 2006 - ingentaconnect.com
One of the main topics in genomics is to determine the relevance of DNA variations with
some genetic disease. Single nucleotide polymorphism (SNP) is the most frequent and …

Islands of tractability for parsimony haplotyping

R Sharan, BV Halldórsson… - IEEE/ACM Transactions on …, 2006 - ieeexplore.ieee.org
We study the parsimony approach to haplotype inference, which calls for finding a set of
haplotypes of minimum cardinality that explains an input set of genotypes. We prove that the …

The minimum substring cover problem

D Hermelin, D Rawitz, R Rizzi, S Vialette - Information and Computation, 2008 - Elsevier
In this paper, we consider the problem of covering a set of strings S with a set C of substrings
in S, where C is said to cover S if every string in S can be written as a concatenation of the …

Haplotype inference with pseudo-Boolean optimization

A Graça, J Marques-Silva, I Lynce… - Annals of Operations …, 2011 - Springer
The fast development of sequencing techniques in the recent past has required an urgent
development of efficient and accurate haplotype inference tools. Besides being a crucial …

Disentangling homeologous contigs in allo-tetraploid assembly: application to durum wheat

V Ranwez, Y Holtz, G Sarah, M Ardisson, S Santoni… - BMC …, 2013 - Springer
Abstract Background Using Next Generation Sequencing, SNP discovery is relatively easy
on diploid species and still hampered in polyploid species by the confusion due to …