Algorithms for Indexing Highly Similar DNA Sequences (Q3305514): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PATRICIA / 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.1007/978-3-319-59826-0_1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2754235768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing the Space Requirement of LZ-Index / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest automaton recognizing the subwords of a text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete inverted files for efficient text retrieval and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Database Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Relative Lempel-Ziv Self-index for Similar Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sorting-complexity of suffix tree construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing compressed text / rank
 
Normal rank
Property / cites work
 
Property / cites work: String Processing and Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed representations of sequences and full-text indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing Similar DNA Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of compact directed acyclic word graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Construction of Suffix Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Efficient Linear Time Construction of Suffix Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster suffix sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Finite Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix Arrays: A New Method for On-Line String Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering a lightweight suffix array construction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix Tree of Alignment: An Efficient Index for Similar Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Range Searching in Linear and Almost-Linear Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New text indexing functionalities of the compressed suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate string matching with suffix automata / rank
 
Normal rank

Latest revision as of 05:47, 23 July 2024

scientific article
Language Label Description Also known as
English
Algorithms for Indexing Highly Similar DNA Sequences
scientific article

    Statements

    Algorithms for Indexing Highly Similar DNA Sequences (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

    Identifiers