scientific article; zbMATH DE number 1877046

zbMATH Open1016.92023MaRDI QIDQ4796705FDOQ4796705

Authors: Giuseppe Lancia, Vineet Bafna, Ross A. Lippert, Russell Schwartz, Sorin Istrail 

Publication date: 20 March 2003

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1945152
• A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI
• Polynomial and APX-hard cases of the individual haplotyping problem
• Haplotype assembly from aligned weighted SNP fragments
• The complexity of the single individual SNP haplotyping problem

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics on words (68R15) Computational methods for problems pertaining to biology (92-08)

Cited In (34)

• Polynomial and APX-hard cases of the individual haplotyping problem
• Computational Methods for SNPs and Haplotype Inference
• On the complexity of MMSNP
• A dynamic programming algorithm for the \(k\)-haplotyping problem
• Haplotype assembly from aligned weighted SNP fragments
• Title not available (Why is that?)
• New results for the longest haplotype reconstruction problem
• On the quantity and quality of single nucleotide polymorphisms in the human genome.
• A practical algorithm based on particle swarm optimization for haplotype reconstruction
• Selection of minimum subsets of single nucleotide polymorphisms to capture haplotype block diversity
• Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph
• A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem
• A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI
• Algorithmic approaches for the single individual haplotyping problem
• Inductive graph invariants and approximation algorithms
• Designing optimally multiplexed SNP genotyping assays
• Reinforcement learning for combinatorial optimization: a survey
• Title not available (Why is that?)
• The haplotyping problem: an overview of computational models and solutions
• Efficient Algorithms for SNP Haplotype Block Selection Problems
• Phasing of 2-SNP Genotypes Based on Non-random Mating Model
• Self-organizing map approaches for the haplotype assembly problem
• An effective haplotype assembly algorithm based on hypergraph partitioning
• Clique-detection models in computational biochemistry and genomics
• Solving VLSI design and DNA sequencing problems using bipartization of graphs
• Parameterizing MAX SNP Problems Above Guaranteed Values
• Title not available (Why is that?)
• The complexity of the single individual SNP haplotyping problem
• Parameterized complexity analysis for the closest string with wildcards problem
• The haplotype assembly model with genotype information and iterative local-exhaustive search algorithm
• An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs
• A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
• A practical exact algorithm for the individual haplotyping problem MEC/GI
• On the Approximability of Some Haplotyping Problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796705)