New results for the longest haplotype reconstruction problem (Q423956): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 92D10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 92-08 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 92C40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6039501 / rank
 
Normal rank
Property / zbMATH Keywords
 
computational biology
Property / zbMATH Keywords: computational biology / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation complexity
Property / zbMATH Keywords: approximation complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed-parameter algorithms
Property / zbMATH Keywords: fixed-parameter algorithms / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2011.10.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2072836445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The haplotyping problem: an overview of computational models and solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the single individual SNP haplotyping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Opportunities for Combinatorial Optimization in Computational Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of comparing evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating the longest path in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:29, 5 July 2024

scientific article
Language Label Description Also known as
English
New results for the longest haplotype reconstruction problem
scientific article

    Statements

    Identifiers