Sciweavers

304 search results - page 9 / 61
» Dynamic ordered sets with exponential search trees
Sort
View
FLAIRS
2008
13 years 11 months ago
Answer Set Programming on Expert Feedback to Populate and Extend Dynamic Ontologies
The next generation of online reference works will require structured representations of their contents in order to support scholarly functions such as semantic search, automated ...
Mathias Niepert, Cameron Buckner, Colin Allen
CP
2006
Springer
14 years 9 days ago
Retroactive Ordering for Dynamic Backtracking
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
Roie Zivan, Uri Shapen, Moshe Zazone, Amnon Meisel...
RECOMB
2006
Springer
14 years 9 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 8 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou
IJBRA
2006
92views more  IJBRA 2006»
13 years 8 months ago
Jumpstarting phylogenetic analysis
: Phylogenetic analysis is a central tool in studies of comparative genomics. When a new region of DNA is isolated and sequenced, researchers are often forced to throw away months ...
Jesse Mecham, Mark J. Clement, Quinn Snell, Todd F...