The simplified partial digest problem: approximation and a graph-theoretic model (Q621677): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q57387736, #quickstatements; #temporary_batch_1722545075506
 
(8 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Edmund Kieran Burke / rank
Normal rank
 
Property / author
 
Property / author: Mikhail Y. Kovalyov / rank
Normal rank
 
Property / author
 
Property / author: Edmund Kieran Burke / rank
 
Normal rank
Property / author
 
Property / author: Mikhail Y. Kovalyov / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Boost / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BGL / 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.ejor.2010.07.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075410301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic and Tabu search algorithms for peptide assembly problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected combinatorial problems of computational biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Sequencing by Hybridization via Genetic Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ant colony optimization algorithm for DNA sequencing by hybridization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LATIN 2004: Theoretical Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4470516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some necessary clarifications about the chords' problem and the partial digest problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some operations research methods for analyzing protein sequences and structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Eulerian path approach to DNA fragment assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial digest approach to restriction site mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimization approach to the reconstruction of positional DNA sequencing by hybridization with errors / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57387736 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:44, 1 August 2024

scientific article
Language Label Description Also known as
English
The simplified partial digest problem: approximation and a graph-theoretic model
scientific article

    Statements

    The simplified partial digest problem: approximation and a graph-theoretic model (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 January 2011
    0 references
    integer programming
    0 references
    genome mapping
    0 references
    combinatorial optimization
    0 references
    heuristics
    0 references
    approximation algorithms
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references