Results 101 to 110 of about 6,253 (207)

MapReduce based parallel suffix tree construction for human genome [PDF]

, 2014
Genome indexing is the basis for many bioinformatics applications. Read mapping (sequence alignment) is one such application where the goal is to align millions of short reads against reference genome.
Seung-Jong Park, Satish, Umesh Chandra, Rahul Shah, Shah, Rahul, Umesh Chandra Satish, Patil, Manish, Praveenkumar Kondikoppa, Manish Patil, Park, Seung Jong, Kondikoppa, Praveenkumar   +9 more
core   +2 more sources

Editorial: Special Issue on Efficient Data Structures

Algorithms, 2019
This Special Issue of Algorithms is focused on the design, formal analysis, implementation, and experimental evaluation of efficient data structures for various computational problems.
Jesper Jansson
doaj   +1 more source

Engineering a Compressed Suffix Tree Implementation [PDF]

, 2007
Välimäki N, Gerlach W, Dixit K, Mäkinen V. Engineering a Compressed Suffix Tree Implementation. In: Proceedings of 6th Workshop on Experimental Algorithms (WEA'07).
Välimäki, Niko, Mäkinen, Veli, Dixit, Kashyap, Universität Bielefeld, Wolfgang Gerlach, Gerlach, Wolfgang, Niko Välimäki, Veli Mäkinen, Kashyap Dixit   +8 more
core   +1 more source

Measuring Contribution of HTML Features in Web Document Clustering

CLEI Electronic Journal, 2008
Documents in HTML format have many features to analyze, from the terms in special sections to the phrases that appear in the whole document. However, it is important to decide which feature contributes the most to separate documents according to classes.
Esteban Meneses, Oldemar Rodríguez-Rojas   +1 more
doaj   +1 more source

Parallel Query in the Suffix Tree

CoRR, 2015
Given the query string of length $m$, we explore a parallel query in a static suffix tree based data structure for $p \ll n$, where $p$ is the number of processors and $n$ is the length of the text. We present three results on CREW PRAM. The parallel query in the suffix trie requires $O(m + p)$ work, $O(m/p + \lg p)$ time and $O(n^2)$ space in the ...
Matevz Jekovec, Andrej Brodnik
openaire   +2 more sources

The suffix tree document model revisited [PDF]

, 1992
: In text-based information retrieval, which is the predominant retrieval task at present, several document models have been proposed, such as boolean, probabilistic, or (extended) vector models [Baeza-Yates and Ribeiro-Neto 1999].
Sven Meyer Zu Eissen, Benno Stein, Martin Potthast   +2 more
core  

DTA-SiST: de novo transcriptome assembly by using simplified suffix trees

BMC Bioinformatics, 2019
Background Alternative splicing allows the pre-mRNAs of a gene to be spliced into various mRNAs, which greatly increases the diversity of proteins. High-throughput sequencing of mRNAs has revolutionized our ability for transcripts reconstruction. However,
Jin Zhao, Haodi Feng, Daming Zhu, Chi Zhang, Ying Xu   +4 more
doaj   +1 more source

ABSTRACT Genome-scale Disk-based Suffix Tree Indexing [PDF]

, 2008
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffix trees are widely used to solve many sequence-based problems, and they can
Mohammed J. Zaki, Benjarath Phoophakdee
core  

The Greek Name for Pistachio

Erga-Logoi
This paper is a detailed study of the Greek name for pistachio, its attestation, forms, meaning and etymology. The author argues that the neuter nouns πιστάκιον and βιστάκιον ‘pistachio nut and tree’ are primary.
Rafal Rosol
doaj   +1 more source

Suffix tree construction with minimized branching [PDF]

, 2012
Suffix tree is a data structure which enables the performing of fast search-like operations on the text. In order to be used efficiently, it must be created quickly.
Bašista, Peter
core