Verifying and enumerating parameterized border arrays (Q650937): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2011.09.008 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036743346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized pattern matching: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parameterized string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of a suffix tree for RNA structural pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alphabet dependence in parameterized matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized matching with mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodicity and repetitions in parameterized strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight Parameterized Suffix Array Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple matching of parameterized patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching / 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: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting suffix arrays and strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: REVERSE ENGINEERING PREFIX TABLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validating the Knuth-Morris-Pratt Failure Function, Fast and Online / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover Array String Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversing Longest Previous Factor Tables is Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4795855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3370008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting distinct strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix Arrays: A New Method for On-Line String Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast string searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line string superprimitivity test / 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: The smallest automaton recognizing the subwords of a text / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line construction of suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inferring strings from suffix trees and links on a binary alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing longest previous factor in linear time and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Parameterized Border Arrays for a Binary Alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying a Parameterized Border Array in O(n 1.5) Time / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2011.09.008 / rank
 
Normal rank

Latest revision as of 23:48, 9 December 2024

scientific article
Language Label Description Also known as
English
Verifying and enumerating parameterized border arrays
scientific article

    Statements

    Verifying and enumerating parameterized border arrays (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2011
    0 references
    string matching
    0 references
    parameterized pattern matching
    0 references
    reverse engineering
    0 references
    enumeration algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers