Sciweavers

917 search results - page 165 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
BMCBI
2008
116views more  BMCBI 2008»
13 years 9 months ago
Gene Ontology annotations: what they mean and where they come from
To address the challenges of information integration and retrieval, the computational genomics community increasingly has come to rely on the methodology of creating annotations o...
David P. Hill, Barry Smith, Monica S. McAndrews-Hi...
RECOMB
2005
Springer
14 years 9 months ago
Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
STACS
1992
Springer
14 years 1 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
BMCBI
2008
77views more  BMCBI 2008»
13 years 9 months ago
SeqAn An efficient, generic C++ library for sequence analysis
Background: The use of novel algorithmic techniques is pivotal to many important problems in life science. For example the sequencing of the human genome [1] would not have been p...
Andreas Döring, David Weese, Tobias Rausch, K...
BMCBI
2006
116views more  BMCBI 2006»
13 years 9 months ago
Optimized mixed Markov models for motif identification
Background: Identifying functional elements, such as transcriptional factor binding sites, is a fundamental step in reconstructing gene regulatory networks and remains a challengi...
Weichun Huang, David M. Umbach, Uwe Ohler, Leping ...