scientific article; zbMATH DE number 1877046

zbMath1016.92023MaRDI QIDQ4796705

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

Publication date: 20 March 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (21)

The haplotyping problem: an overview of computational models and solutions ⋮ A practical exact algorithm for the individual haplotyping problem MEC/GI ⋮ Self-organizing map approaches for the haplotype assembly problem ⋮ Reinforcement learning for combinatorial optimization: a survey ⋮ An effective haplotype assembly algorithm based on hypergraph partitioning ⋮ Inductive graph invariants and approximation algorithms ⋮ 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 ⋮ New results for the longest haplotype reconstruction problem ⋮ Solving VLSI design and DNA sequencing problems using bipartization of graphs ⋮ A dynamic programming algorithm for the \(k\)-haplotyping problem ⋮ The haplotype assembly model with genotype information and iterative local-exhaustive search algorithm ⋮ A quantum walk-assisted approximate algorithm for bounded NP optimisation problems ⋮ Parameterized complexity analysis for the closest string with wildcards problem ⋮ An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs ⋮ Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph ⋮ Clique-detection models in computational biochemistry and genomics ⋮ Polynomial and APX-hard cases of the individual haplotyping problem ⋮ A practical algorithm based on particle swarm optimization for haplotype reconstruction ⋮ Algorithmic approaches for the single individual haplotyping problem ⋮ On the Approximability of Some Haplotyping Problems

This page was built for publication: