The Contig Assembly Problem and Its Algorithmic Solutions (Q3305536): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-59826-0_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2754802449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space/time trade-offs in hash coding with allowable errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms for DNA sequence assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling metagenome sequence assembly with probabilistic de Bruijn graphs / 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: The consensus string problem for a metric is NP-complete / rank
 
Normal rank

Latest revision as of 06:47, 23 July 2024

scientific article
Language Label Description Also known as
English
The Contig Assembly Problem and Its Algorithmic Solutions
scientific article

    Statements

    The Contig Assembly Problem and Its Algorithmic Solutions (English)
    0 references
    0 references
    0 references
    0 references
    7 August 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references