scientific article; zbMATH DE number 1877046
From MaRDI portal
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)- On the Approximability of Some Haplotyping Problems
- 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
- New results for the longest haplotype reconstruction problem
- scientific article; zbMATH DE number 7651113 (Why is no real title available?)
- 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
- Algorithmic approaches for the single individual haplotyping problem
- 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
- Designing optimally multiplexed SNP genotyping assays
- Inductive graph invariants and approximation algorithms
- Reinforcement learning for combinatorial optimization: a survey
- The haplotyping problem: an overview of computational models and solutions
- scientific article; zbMATH DE number 2040938 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1945152 (Why is no real title available?)
- The complexity of the single individual SNP haplotyping problem
- 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
- The haplotype assembly model with genotype information and iterative local-exhaustive search algorithm
- A quantum walk-assisted approximate algorithm for bounded NP optimisation problems
- A practical exact algorithm for the individual haplotyping problem MEC/GI
- abSNP: RNA-Seq SNP calling in repetitive regions via abundance estimation
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)
