scientific article; zbMATH DE number 1945152
From MaRDI portal
zbMath1016.68685MaRDI QIDQ4408101
Giuseppe Lancia, Romeo Rizzi, Vineet Bafna, Sorin Istrail
Publication date: 2 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2452/24520029.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Computing methodologies and applications (68U99) Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10)
Related Items
On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal, The haplotyping problem: an overview of computational models and solutions, Self-organizing map approaches for the haplotype assembly problem, Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information, Graph Bipartization Problem with Applications to Via Minimization in VLSI Design, A dynamic programming algorithm for the \(k\)-haplotyping problem, The haplotype assembly model with genotype information and iterative local-exhaustive search algorithm, Parameterized complexity analysis for the closest string with wildcards problem, Planar graph bipartization in linear time, Finding odd cycle transversals., Haplotype assembly from aligned weighted SNP fragments, 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, Faster graph bipartization, On the Approximability of Some Haplotyping Problems
