Results 21 to 30 of about 58,956 (207)
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings [PDF]
, 2015 We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the construction of both the suffix trie and suffix tree. Using this structure,
Rubinchik, Mikhail, Shur, Arseny M.
core +1 more source
Analysis of the multiplicity matching parameter in suffix trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In a suffix tree, the multiplicity matching parameter (MMP) $M_n$ is the number of leaves in the subtree rooted at the branching point of the $(n+1)$st insertion.
Mark Daniel Ward, Wojciech Szpankowski
doaj +1 more source
On Suffix Extensions in Suffix Trees
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Breslauer D, Italiano G
openaire +6 more sources
A Review on Planted (l, d) Motif Discovery Algorithms for Medical Diagnose
Sensors, 2022 Personalized diagnosis of chronic disease requires capturing the continual pattern across the biological sequence. This repeating pattern in medical science is called “Motif”.
Satarupa Mohanty +3 more
doaj +1 more source
String Indexing with Compressed Patterns [PDF]
, 2020 Given a string S of length n, the classic string indexing problem is to preprocess S into a compact data structure that supports efficient subsequent pattern queries.
, Bille, Philip, Steiner, Teresa Anna
core +2 more sources
Journal of Big Data, 2017 Route prediction is an essential requirement for many intelligent transport systems (ITS) services like VANETS, traffic congestion estimation, resource prediction in grid computing etc.
Vishnu Shankar Tiwari, Arti Arya
doaj +1 more source
An Efficient Approach to Mining Maximal Contiguous Frequent Patterns from Large DNA Sequence Databases [PDF]
Genomics & Informatics, 2012 Mining interesting patterns from DNA sequences is one of the most challenging tasks in bioinformatics and computational biology. Maximal contiguous frequent patterns are preferable for expressing the function and structure of DNA sequences and hence can ...
Md. Rezaul Karim +3 more
doaj +1 more source
Frequent Word Sequence Mining Algorithm in Continuous Time Interval [PDF]
Jisuanji gongcheng, 2022 Mining frequent phrases in a text assists in the quick understanding of the content, but traditional algorithms for frequent word sequence mining usually have high time complexity in mining tasks, and fail to deal with frequently changing query criteria ...
WANG Lu, LIU Xiaoqing, HE Zhenying
doaj +1 more source
Cancer Informatics, 2009 Efficient and effective analysis of the growing genomic databases requires the development of adequate computational tools. We introduce a fast method based on the suffix tree data structure for predicting novel targets of hypoxia-inducible factor 1 (HIF-
Yue Jiang +6 more
doaj +2 more sources
RANCANG BANGUN APLIKASI PENCARIAN DOKUMEN BERBASIS WEB MENGGUNAKAN METODE SUFFIX CACTUS CLUSTERING
JUTI: Jurnal Ilmiah Teknologi Informasi, 2003 Salah satu bagian dari temu kembali (retrieval) informasi adalah menyajikan data hasil pencarian dengan cara mengelompokkan (clustering) seluruh dokumen hasil pencarian sesuai dengan kemiripan antar dokumen.
F. X. Arunanto, Agus Widodo
doaj +1 more source