On the Shortest Common Superstring of NGS Reads (Q2988815): 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-55911-7_8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2599130894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(2_3^2\) superstring approximation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear approximation of shortest superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotations of Periodic Strings and Short Superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Three Versions of the Shortest Common Superstring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential and Parallel Approximation of Shortest Superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why greed works for shortest common superstring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the greedy algorithm for the shortest common superstring problem with reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding minimal length superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Shortest Superstring Problem Using de Bruijn Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periods in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periods and borders of random words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The greedy algorithm for shortest superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy approximation algorithm for constructing shortest common superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Shortest Superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank

Latest revision as of 20:08, 13 July 2024

scientific article
Language Label Description Also known as
English
On the Shortest Common Superstring of NGS Reads
scientific article

    Statements

    On the Shortest Common Superstring of NGS Reads (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 May 2017
    0 references
    shortest superstring problem
    0 references
    approximation algorithms
    0 references
    next-generation sequencing
    0 references

    Identifiers

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