Improved approximate string matching using compressed suffix data structures (Q930602): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/s00453-007-9104-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2615813815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Text Indexing and Dictionary Matching with One Error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dictionary matching and indexing with errors and don't cares / 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: Q4035246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel and serial approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representation of Balanced Parentheses and Static Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Efficient Suffix Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space trade-offs for compressed suffix arrays. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed suffix trees with full functionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory and computation of evolutionary distances: Pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log-logarithmic worst-case range queries are possible in space theta(N) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:58, 28 June 2024

scientific article
Language Label Description Also known as
English
Improved approximate string matching using compressed suffix data structures
scientific article

    Statements

    Identifiers