Sciweavers

35 search results - page 7 / 7
» A compression algorithm for DNA sequences and its applicatio...
Sort
View
JCB
2006
124views more  JCB 2006»
13 years 5 months ago
The Average Common Substring Approach to Phylogenomic Reconstruction
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
Igor Ulitsky, David Burstein, Tamir Tuller, Benny ...
BMCBI
2006
114views more  BMCBI 2006»
13 years 5 months ago
Evaluation and comparison of mammalian subcellular localization prediction methods
Background: Determination of the subcellular location of a protein is essential to understanding its biochemical function. This information can provide insight into the function o...
Josefine Sprenger, J. Lynn Fink, Rohan D. Teasdale
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
12 years 9 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
13 years 11 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
14 years 5 months ago
Genome-scale disk-based suffix tree indexing
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
Benjarath Phoophakdee, Mohammed J. Zaki