Compressed directed acyclic word graph with application in local alignment (Q378207): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The smallest automaton recognizing the subwords of a text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexing compressed text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank/select operations on large alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultra-succinct representation of ordered trees with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case analysis of approximate trie search / 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: Compressed suffix trees with full functionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2005: Theory and Practice of Computer Science / rank
 
Normal rank

Latest revision as of 00:39, 7 July 2024

scientific article
Language Label Description Also known as
English
Compressed directed acyclic word graph with application in local alignment
scientific article

    Statements

    Compressed directed acyclic word graph with application in local alignment (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2013
    0 references
    directed acyclic word graph
    0 references
    compression
    0 references
    suffix tree
    0 references
    suffix array
    0 references
    local alignment
    0 references
    0 references
    0 references

    Identifiers