Reconstructing parameterized strings from parameterized suffix and LCP arrays (Q6166972): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Function Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Alphabet Independent Approach to Two-Dimensional Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alphabet dependence in parameterized matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5088893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a real time algorithm for parameterized longest common prefix computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized matching with mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized pattern matching: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Words over an ordered alphabet and suffix permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank

Latest revision as of 11:46, 2 August 2024

scientific article; zbMATH DE number 7722474
Language Label Description Also known as
English
Reconstructing parameterized strings from parameterized suffix and LCP arrays
scientific article; zbMATH DE number 7722474

    Statements

    Identifiers