Sciweavers

26 search results - page 3 / 6
» Persistent Indexing Technology for Large Sequences
Sort
View
BMCBI
2006
145views more  BMCBI 2006»
13 years 7 months ago
Querying the public databases for sequences using complex keywords contained in the feature lines
Background: High throughput technologies often require the retrieval of large data sets of sequences. Retrieval of EMBL or GenBank entries using keywords is easy using tools such ...
Olivier Croce, Michaël Lamarre, Richard Chris...
CIKM
2008
Springer
13 years 9 months ago
TinyLex: static n-gram index pruning with perfect recall
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...
Derrick Coetzee
ICDE
2008
IEEE
125views Database» more  ICDE 2008»
14 years 8 months ago
RAD: A Scalable Framework for Annotator Development
Developments in semantic search technology have motivated the need for efficient and scalable entity annotation techniques. We demonstrate RAD: a tool for Rapid Annotator Developme...
Sanjeet Khaitan, Ganesh Ramakrishnan, Sachindra Jo...
VLDB
2005
ACM
162views Database» more  VLDB 2005»
14 years 24 days ago
FiST: Scalable XML Document Filtering by Sequencing Twig Patterns
In recent years, publish-subscribe (pub-sub) systems based on XML document filtering have received much attention. In a typical pubsub system, subscribed users specify their inte...
Joonho Kwon, Praveen Rao, Bongki Moon, Sukho Lee
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...