A sublinear time string prefix square detection algorithm (Q5473096): 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.1080/09720529.2006.10698063 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152498234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and flexible detection of contiguous repeats using a suffix tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:14, 24 June 2024

scientific article; zbMATH DE number 5034064
Language Label Description Also known as
English
A sublinear time string prefix square detection algorithm
scientific article; zbMATH DE number 5034064

    Statements

    Identifiers