Sciweavers

3544 search results - page 627 / 709
» Rethinking the Presentation of Results from Web Search
Sort
View
ICCAD
2001
IEEE
144views Hardware» more  ICCAD 2001»
15 years 6 months ago
Faster SAT and Smaller BDDs via Common Function Structure
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
BMCBI
2010
124views more  BMCBI 2010»
14 years 10 months ago
Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
Norman E. Davey, Richard J. Edwards, Denis C. Shie...
IPM
2007
95views more  IPM 2007»
14 years 9 months ago
Using structural contexts to compress semistructured text collections
We describe a compression model for semistructured documents, called Structural Contexts Model (SCM), which takes advantage of the context information usually implicit in the stru...
Joaquín Adiego, Gonzalo Navarro, Pablo de l...
BMCBI
2005
306views more  BMCBI 2005»
14 years 9 months ago
A method for aligning RNA secondary structures and its application to RNA motif detection
Background: Alignment of RNA secondary structures is important in studying functional RNA motifs. In recent years, much progress has been made in RNA motif finding and structure a...
Jianghui Liu, Jason Tsong-Li Wang, Jun Hu, Bin Tia...
IANDC
2008
141views more  IANDC 2008»
14 years 10 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...