An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs (Q958213): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4796705 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Polynomial and APX-hard cases of the individual haplotyping problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Comparing Assemblies Using Fragments and Mate-Pairs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Experimental and Efficient Algorithms / rank | |||
Normal rank | |||
Revision as of 20:58, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs |
scientific article |
Statements
An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs (English)
0 references
2 December 2008
0 references
SNP
0 references
single-nucleotide polymorphism
0 references
genotype
0 references
haplotype
0 references
NP-hardness
0 references
parameterized algorithm
0 references
