Results 121 to 130 of about 735,070 (175)

The enhanced suffix array yields a tree structure of nested suffix intervals.

, 2013
The enhanced suffix array for the sequence S: = attcttcggc (left) and its suffix interval tree (right), equivalent to the suffix trie in Fig. 2, is shown. The array suf represents the lexicographical order of the suffixes in S$.
Cynthia M. Sharma (95322), Philipp Khaitovich (15794), Christian Otto (315144), Steve Hoffmann (242470), Stefan Kurtz (1227), Jörg Hackermüller (39435), Jörg Vogel (11205), Peter F. Stadler (14224)   +7 more
core   +1 more source

A taxonomy of suffix array construction algorithms

, 2005
In 1990 Manber & Myers proposed suffix arrays as a space-saving alternative to suffix trees and described the first algorithms for suffix array construction and use.
Smyth, W.F., Turpin, A., Puglisi, S.J.
core  

Effective primer design for genotype and subtype detection of highly divergent viruses in large scale genome datasets

BMC Bioinformatics
Identification of microorganisms in a biological sample is a crucial step in diagnostics, pathogen screening, biomedical research, evolutionary studies, agriculture, and biological threat assessment.
Burak Demiralay, Tolga Can
doaj   +1 more source

Scalable Parallel Suffix Array Construction

, 2008
. Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in bioinformatics.
Peter S, Fabian Kulla
core  

Suffix array construction algorithms

, 2007
Suffix array is a data structure used for string operations such as pattern matching. It is also useful for some lossless data compression algorithms.
Žoha, Pavel
core  

Improving Suffix-Array Construction Algorithms with Applications

, 2008
The suffix array has been considered better in practice than suffix trees for many applications, after it was first presented by Manber and Myers [MM93], because it possesses several merits.
Tsai-hsing Kao
core  

Suffix arrays in theory and practice.

, 2007
The suffix array of a string is a permutation of all starting positions of the string's suffixes in lexicographical order. In this thesis, we investigate mathematical and algorithmical aspects of suffix arrays. The first part mainly deals with combinatorial properties of suffix arrays and their enumeration.
openaire   +2 more sources

Explication of the Structure of Simple Persian Verbs and Their Governing Principles, With an Emphasis on Root Types and Morpheme Formation; A Linguistic Perspective [In Persian]

زبان کاوی کاربردی
The verb represents the most fundamental element across all global languages (a universal linguistic feature). Verbs occupy a central role within the framework of grammatical concordance (agreement between verb and subject). Language, as a dynamic social
Zahra Khosravi Dastgerdi, Ali Naseri Karimvand   +1 more
doaj  

Suffix Array

Journal of the Japanese Society for Artificial Intelligence, 2000
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Property Suffix Array with Applications

Lecture Notes in Computer Science, 2018
The suffix array is one of the most prevalent data structures for string indexing; it stores the lexicographically sorted list of suffixes of a given string. Its practical advantage compared to the suffix tree is space efficiency. In Property Indexing, we are given a string x of length n and a property \(\varPi \), i.e.
Solon Pissis, Panagiotis Charalampopoulos, Costas Iliopoulos   +2 more
exaly   +3 more sources