Mining approximate patterns with frequent locally optimal occurrences (Q906440): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An optimal decomposition algorithm for tree edit distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on the Common Subexpression Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding and representing all the tandem repeats in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tree-to-Tree Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently mining \(\delta \)-tolerance closed frequent subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPADE: An efficient algorithm for mining frequent sequences / rank
 
Normal rank

Latest revision as of 09:19, 11 July 2024

scientific article
Language Label Description Also known as
English
Mining approximate patterns with frequent locally optimal occurrences
scientific article

    Statements

    Identifiers