Results 21 to 30 of about 58,659 (213)
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
Fully compressed suffix trees [PDF]
ACM Transactions on Algorithms, 2008 Suffix trees are by far the most important data structure in stringology, with a myriad of applications in fields like bioinformatics and information retrieval. Classical representations of suffix trees require Θ( n log n ) bits of space, for a string of size n .
Luís M. S. Russo +2 more
openaire +1 more source
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
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
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
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
Computational and Structural Biotechnology Journal, 2022 Multiple DNA/RNA sequence alignment is an important fundamental tool in bioinformatics, especially for phylogenetic tree construction. With DNA-sequencing improvements, the amount of bioinformatics data is constantly increasing, and various tools need to
Ziyuan Wang +7 more
doaj +1 more source
Pattern Matching on Sparse Suffix Trees [PDF]
, 2011 International audienceWe consider a compact text index based on evenly spaced sparse suffix trees of a text [9]. Such a tree is defined by partitioning the text into blocks of equal size and constructing the suffix tree only for those suffixes that start
Kolpakov, Roman +2 more
core +7 more sources