Sciweavers

2930 search results - page 337 / 586
» The optimal sequence compression
Sort
View
BMCBI
2010
111views more  BMCBI 2010»
15 years 6 months ago
Dynamic probe selection for studying microbial transcriptome with high-density genomic tiling microarrays
Background: Current commercial high-density oligonucleotide microarrays can hold millions of probe spots on a single microscopic glass slide and are ideal for studying the transcr...
Hedda Høvik, Tsute Chen
JCP
2006
139views more  JCP 2006»
15 years 6 months ago
Generalized Sequential Pattern Mining with Item Intervals
Sequential pattern mining is an important data mining method with broad applications that can extract frequent sequences while maintaining their order. However, it is important to ...
Yu Hirate, Hayato Yamana
BMCBI
2005
82views more  BMCBI 2005»
15 years 6 months ago
A novel method for prokaryotic promoter prediction based on DNA stability
Background: In the post-genomic era, correct gene prediction has become one of the biggest challenges in genome annotation. Improved promoter prediction methods can be one step to...
Aditi Kanhere, Manju Bansal
CN
1999
100views more  CN 1999»
15 years 6 months ago
Testing protocols modeled as FSMs with timing parameters
An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active t...
M. Ümit Uyar, Mariusz A. Fecko, Adarshpal S. ...
BMCBI
2011
14 years 10 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes