Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance (Q2946041): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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/978-3-319-19315-1_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1766660969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prefix Table Construction and Conversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Aho Corasick automaton in linear time for integer alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inducing the LCP-Array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-optimal single and multiple approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding All Approximate Gapped Palindromes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest common extension problem revisited and applications to approximate string searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental String Comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for finding all repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate All-Pairs Suffix/Prefix Overlaps / rank
 
Normal rank

Latest revision as of 19:15, 10 July 2024

scientific article
Language Label Description Also known as
English
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance
scientific article

    Statements

    Identifiers