Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem (Q990128): 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.1016/j.ipl.2009.10.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095356161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Replacing suffix trees with enhanced suffix arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the all pairs suffix-prefix problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547749 / rank
 
Normal rank

Latest revision as of 03:25, 3 July 2024

scientific article
Language Label Description Also known as
English
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
scientific article

    Statements

    Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem (English)
    0 references
    0 references
    0 references
    2 September 2010
    0 references
    algorithms
    0 references
    suffix array
    0 references
    suffix-prefix matching
    0 references

    Identifiers