Showing 1 - 20 results of 31 for search '"suffix tree"', query time: 0.13s Refine Results
  1. 1
    Reversed Lempel–Ziv Factorization with Suffix Trees

    Reversed Lempel–Ziv Factorization with Suffix Trees by Dominik Köppl

    Published 2021-05-01
    Subjects:
    Get full text
    Article
  2. 2
    Analysis of the multiplicity matching parameter in suffix trees

    Analysis of the multiplicity matching parameter in suffix trees by Mark Daniel Ward, Wojciech Szpankowski

    Published 2005-01-01
    Subjects:
    Get full text
    Article
  3. 3
    Average profiles, from tries to suffix-trees

    Average profiles, from tries to suffix-trees by Pierre Nicodème

    Published 2005-01-01
    Subjects:
    Get full text
    Article
  4. 4
    On the Number of 2-Protected Nodes in Tries and Suffix Trees

    On the Number of 2-Protected Nodes in Tries and Suffix Trees by Jeffrey Gaither, Yushi Homma, Mark Sellke, Mark Daniel Ward

    Published 2012-01-01
    Subjects:
    Get full text
    Article
  5. 5
    Analysis of the average depth in a suffix tree under a Markov model

    Analysis of the average depth in a suffix tree under a Markov model by Julien Fayolle, Mark Daniel Ward

    Published 2005-01-01
    Subjects:
    Get full text
    Article
  6. 6
    Detecting Pattern Anomalies in Hydrological Time Series with Weighted Probabilistic Suffix Trees

    Detecting Pattern Anomalies in Hydrological Time Series with Weighted Probabilistic Suffix Trees by Yufeng Yu, Dingsheng Wan, Qun Zhao, Huan Liu

    Published 2020-05-01
    Subjects: “…weighted Probabilistic Suffix Tree…”
    Get full text
    Article
  7. 7
    Cpu Usage Pattern Discovery Using Suffix Tree For Computational Resource Advisory System

    Cpu Usage Pattern Discovery Using Suffix Tree For Computational Resource Advisory System by Ooi, Boon Yaik

    Published 2006
    Get full text
    Thesis
  8. 8
    Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees

    Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees by Dominik Köppl

    Published 2021-01-01
    Subjects:
    Get full text
    Article
  9. 9
    Optimasi Suffix Tree Clustering dengan Wordnet dan Named Entity Recognition untuk Pengelompokan Dokumen

    Optimasi Suffix Tree Clustering dengan Wordnet dan Named Entity Recognition untuk Pengelompokan Dokumen by Satrio Hadi Wijoyo, Admaja Dwi Herlambang, Fahrur Rozi, Septiyan Andika Isanta

    Published 2017-12-01
    Subjects:
    Get full text
    Article
  10. 10
    IMPLEMENTASI ALGORITMA SUFFIX TREE CLUSTERING DAN NEAREST NEIGHBOR UNTUK MENGELOMPOKKAN BERITA PADA TIMELINE TWITTER

    IMPLEMENTASI ALGORITMA SUFFIX TREE CLUSTERING DAN NEAREST NEIGHBOR UNTUK MENGELOMPOKKAN BERITA PADA TIMELINE TWITTER by , JUMADI, , Drs..Edi.Winarko,.M.Sc.,.Ph.D.,.

    Published 2013
    “…Grouping system suitable for this problem is the clustering system Based on some.existing research one good method in the process of clustering text documents is a Suffix Tree.Clustering (STC). This method has a very high accuracy rate because clusters create based on phrase-shared among documents existing text. …”
    Thesis
  11. 11
    Local Similarity Search to Find Gene Indicators in Mitochondrial Genomes

    Local Similarity Search to Find Gene Indicators in Mitochondrial Genomes by Ruby L. V. Moritz, Matthias Bernt, Martin Middendorf

    Published 2014-03-01
    Subjects: “…suffix tree…”
    Get full text
    Article
  12. 12
    CPU Usage Pattern Discovery Using Suffix Tree For Computational Resource Advisory System [QA76.76.P426 I11 2006 f rb].

    CPU Usage Pattern Discovery Using Suffix Tree For Computational Resource Advisory System [QA76.76.P426 I11 2006 f rb]. by Ooi, Boon Yaik

    Published 2006
    Get full text
    Thesis
  13. 13
    Finding maximal exact matches in graphs

    Finding maximal exact matches in graphs by Nicola Rizzo, Manuel Cáceres, Veli Mäkinen

    Published 2024-03-01
    Subjects:
    Get full text
    Article
  14. 14
    A Review on Planted (<i>l</i>, d) Motif Discovery Algorithms for Medical Diagnose

    A Review on Planted (<i>l</i>, d) Motif Discovery Algorithms for Medical Diagnose by Satarupa Mohanty, Prasant Kumar Pattnaik, Ahmed Abdulhakim Al-Absi, Dae-Ki Kang

    Published 2022-02-01
    Subjects:
    Get full text
    Article
  15. 15
    Efficient Data Structures for Range Shortest Unique Substring Queries

    Efficient Data Structures for Range Shortest Unique Substring Queries by Paniz Abedin, Arnab Ganguly, Solon P. Pissis, Sharma V. Thankachan

    Published 2020-10-01
    Subjects:
    Get full text
    Article
  16. 16
    More Time-Space Tradeoffs for Finding a Shortest Unique Substring

    More Time-Space Tradeoffs for Finding a Shortest Unique Substring by Hideo Bannai, Travis Gagie, Gary Hoppenworth, Simon J. Puglisi, Luís M. S. Russo

    Published 2020-09-01
    Subjects:
    Get full text
    Article
  17. 17
    Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time

    Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time by Sebastian Schmidt, Jarno N. Alanko

    Published 2023-07-01
    Subjects:
    Get full text
    Article
  18. 18
    Optimal Prefix and Suffix Queries on Texts

    Optimal Prefix and Suffix Queries on Texts by Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman

    Published 2007-01-01
    Subjects:
    Get full text
    Article
  19. 19
    A tight upper bound on the size of the antidictionary of a binary string

    A tight upper bound on the size of the antidictionary of a binary string by Hiroyoshi Morita, Takahiro Ota

    Published 2005-01-01
    Subjects:
    Get full text
    Article
  20. 20
    On Correlation Polynomials and Subword Complexity

    On Correlation Polynomials and Subword Complexity by Irina Gheorghiciuc, Mark Daniel Ward

    Published 2007-01-01
    Subjects:
    Get full text
    Article

Search Tools: