Sciweavers

114 search results - page 14 / 23
» The Tree Inclusion Problem: In Linear Space and Faster
Sort
View
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
15 years 9 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
IJIT
2004
14 years 10 months ago
"Intuition" Operator: Providing Genomes with Reason
In this contribution, the use of a new genetic operator is proposed. The main advantage of using this operator is that it is able to assist the evolution procedure to converge fast...
Grigorios N. Beligiannis, Georgios A. Tsirogiannis...
BMCBI
2006
122views more  BMCBI 2006»
14 years 9 months ago
A multivariate prediction model for microarray cross-hybridization
Background: Expression microarray analysis is one of the most popular molecular diagnostic techniques in the post-genomic era. However, this technique faces the fundamental proble...
Yian A. Chen, Cheng-Chung Chou, Xinghua Lu, Elizab...
STACS
1999
Springer
15 years 1 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
ICML
2005
IEEE
15 years 10 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III