Pages that link to "Item:Q1884294"
From MaRDI portal
The following pages link to The haplotyping problem: an overview of computational models and solutions (Q1884294):
Displaying 10 items.
- New results for the longest haplotype reconstruction problem (Q423956) (← links)
- Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453) (← links)
- Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics (Q555381) (← links)
- A colored graph approach to perfect phylogeny with persistent characters (Q728267) (← links)
- Particle swarm optimization for SNP haplotype reconstruction problem (Q2474882) (← links)
- Clique-detection models in computational biochemistry and genomics (Q2491763) (← links)
- A practical parameterised algorithm for the individual haplotyping problem MLF (Q3060194) (← links)
- The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification (Q3060204) (← links)
- The pure parsimony haplotyping problem: overview and computational advances (Q3563606) (← links)
- Beyond evolutionary trees (Q5962068) (← links)
