Sciweavers

1522 search results - page 3 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
ISAAC
2005
Springer
81views Algorithms» more  ISAAC 2005»
14 years 11 days ago
Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem
We study the complexity and approximation of the problem of reconstructing haplotypes from genotypes on pedigrees under the Mendelian Law of Inheritance and the minimum recombinant...
Lan Liu, Xi Chen, Jing Xiao, Tao Jiang
DMTCS
2003
99views Mathematics» more  DMTCS 2003»
13 years 8 months ago
Combinatorial Problems Arising in SNP and Haplotype Analysis
It is widely anticipated that the study of variation in the human genome will provide a means of predicting risk of a variety of complex diseases. This paper presents a number of a...
Bjarni V. Halldórsson, Vineet Bafna, Nathan...
BMCBI
2004
93views more  BMCBI 2004»
13 years 6 months ago
Predicting binding sites of hydrolase-inhibitor complexes by combining several methods
Background: Protein-protein interactions play a critical role in protein function. Completion of many genomes is being followed rapidly by major efforts to identify interacting pr...
Taner Z. Sen, Andrzej Kloczkowski, Robert L. Jerni...
WABI
2010
Springer
178views Bioinformatics» more  WABI 2010»
13 years 5 months ago
Haplotype Inference on Pedigrees with Recombinations and Mutations
Abstract. Haplotype Inference (HI) is a computational challenge of crucial importance in a range of genetic studies, such as functional genomics, pharmacogenetics and population ge...
Yuri Pirola, Paola Bonizzoni, Tao Jiang
BMCBI
2006
138views more  BMCBI 2006»
13 years 7 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...