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