Sciweavers

1284 search results - page 257 / 257
» Data Structures for Mergeable Trees
Sort
View
106
Voted
BMCBI
2008
128views more  BMCBI 2008»
15 years 1 months ago
Efficient computation of absent words in genomic sequences
Background: Analysis of sequence composition is a routine task in genome research. Organisms are characterized by their base composition, dinucleotide relative abundance, codon us...
Julia Herold, Stefan Kurtz, Robert Giegerich
114
Voted
BMCBI
2004
93views more  BMCBI 2004»
15 years 29 days ago
Predicting binding sites of hydrolase-inhibitor complexes by combining several methods
Background: Protein-protein interactions play a critical role in protein function. Completion of many genomes is being followed rapidly by major efforts to identify interacting pr...
Taner Z. Sen, Andrzej Kloczkowski, Robert L. Jerni...
118
Voted
SPAA
2004
ACM
15 years 6 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
151
Voted
ICALP
2009
Springer
16 years 1 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh