Longest property-preserved common factor: a new string-processing framework (Q2297866): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W3006214012 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1810.02099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Space Algorithms for the Longest Common Substring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Space Trade-Offs for the Longest Common Substring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suffix tree characterization of maximal motifs in biological sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithm for Long LCF with k Mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest common prefixes with \(k\)-errors and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossless filter for multiple repetitions with Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Longest Common Palindromic Subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding a longest common palindromic subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hardness result and new algorithm for the longest common palindromic subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5140779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest property-preserved common factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: The “Runs” Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear approximate string matching and biological applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Seeds Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Prefix/Suffix-Square Free Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computation of local periods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest substring palindrome after edit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest common substring made fully dynamic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5090361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property suffix array with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient seed computation revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967241 / rank
 
Normal rank

Latest revision as of 20:58, 21 July 2024

scientific article
Language Label Description Also known as
English
Longest property-preserved common factor: a new string-processing framework
scientific article

    Statements

    Longest property-preserved common factor: a new string-processing framework (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 February 2020
    0 references
    0 references
    square-free factors
    0 references
    periodic factors
    0 references
    palindromic factors
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references