Crochemore's partitioning on weighted strings and applications (Q1709578): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-016-0266-0 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2582169998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing covers using prefix tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property matching and weighted matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal superprimitivity testing for strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The “Runs” Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced string covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5369536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computation of prefix table for weighted strings {\&} applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Pattern Matching on Uncertain Sequences and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An on-line string superprimitivity test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for computing the repetitions in a word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering problems for partial words and for indeterminate strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time approximation algorithms for weighted LCS problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of some algorithms to detect quasiperiodicities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5446128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern Matching and Consensus Problems on Weighted Sequences and Profiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time version of Holub's algorithm for morphic imprimitivity testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the cover array in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for finding all repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm to compute all the covers of a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of runs in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties of Regularities in Weighted Sequences / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-016-0266-0 / rank
 
Normal rank

Latest revision as of 06:15, 11 December 2024

scientific article
Language Label Description Also known as
English
Crochemore's partitioning on weighted strings and applications
scientific article

    Statements

    Crochemore's partitioning on weighted strings and applications (English)
    0 references
    0 references
    0 references
    0 references
    6 April 2018
    0 references
    weighted strings
    0 references
    uncertain sequences
    0 references
    position-weight matrix
    0 references
    Crochemore partitioning
    0 references
    repetitions
    0 references
    seeds
    0 references
    covers
    0 references

    Identifiers