Results 111 to 120 of about 6,253 (207)
Optimal Suffix Tree Construction with Large Alphabets [PDF]
, 1997 The suffix tree of a string is the fundamental data structure of combinatorial pattern matching. Weiner [Wei73], who introduced the data structure, gave an O(n) time algorithm algorithm for building the suffix tree of an n character string drawn from a ...
Martin Farach
core
Yearbook of Balkan and Baltic StudiesThe study of alien species has become more and more relevant today. In particular, the influence of alien species on the local nature is studied, but more and more studies have also begun to appear on how alien species affect the local language and ...
Jüri Viikberg +2 more
doaj +1 more source
Whole-Genome Alignment: Methods, Challenges, and Future Directions
Applied SciencesWhole-genome alignment (WGA) is a critical process in comparative genomics, facilitating the detection of genetic variants and aiding our understanding of evolution. This paper offers a detailed overview and categorization of WGA techniques, encompassing
Bacem Saada +4 more
doaj +1 more source
Pluribus-Exploring the Limits of Error Correction Using a Suffix Tree. [PDF]
IEEE/ACM Trans Comput Biol Bioinform, 2017 Savel D +3 more
europepmc +1 more source
Implementasi metode suffix tree clustering untuk data hasil search engine [PDF]
, 2012 Seiring dengan semakin pesatnya perkembangan teknologi informasi, menyebabkan banyaknya penyebaran informasi melalui internet. Dalam hal ini search engine memegang peranan penting dalam eksplorasi informasi. Namun search engine saat ini masih belum dapat
Lilis, Lilis
core
Morphology learning using tree of aligned suffix rules [PDF]
, 2007 Linguistic morphology concerns the structure of words, for instance how the plural form of nouns is obtained from their singular form, or how the past tense of verbs is generated from their infinitive.
Ksenia, Shalonova, Flach, Peter
core
Parallel continuous flow: a parallel suffix tree construction tool for whole genomes. [PDF]
J Comput Biol, 2014 Comin M, Farreras M.
europepmc +1 more source
Using the Sadakane compressed suffix tree to solve the all-pairs suffix-prefix problem. [PDF]
Biomed Res Int, 2014 Rachid MH, Malluhi Q, Abouelhoda M.
europepmc +1 more source
Parallel Processing of String Search using Suffix Tree on Multi-core CPU [PDF]
, 2012 application/pdfA suffix tree is the index structure of n-ary tree structure which represented as a tree structure of the suffix string. It is widely used in including bioinformatics, to search engines and data clustering, because it is an index structure
タムラ, ケイイチ +13 more
core
Suffix tree searcher: exploration of common substrings in large DNA sequence sets. [PDF]
BMC Res Notes, 2014 Minkley D +5 more
europepmc +1 more source