Sciweavers

421 search results - page 29 / 85
» String Distances and Uniformities
Sort
View
TSMC
2008
93views more  TSMC 2008»
15 years 4 months ago
Selection of DNA Markers
Given a genome, i.e., a long string over a fixed finite alphabet, the problem is to find short (dis)similar substrings. This computationally intensive task has many biological appl...
Hendrik Jan Hoogeboom, Walter A. Kosters, Jeroen F...
AIPS
2009
15 years 5 months ago
Using Distance Estimates in Heuristic Search
This paper explores the use of an oft-ignored information source in heuristic search: a search-distance-to-go estimate. Operators frequently have different costs and cost-to-go is...
Jordan Tyler Thayer, Wheeler Ruml
AMAI
2007
Springer
15 years 4 months ago
Distance semantics for database repair
Abstract In many scenarios, a database instance violates a given set of integrity constraints. In such cases, it is often required to repair the database, that is, to restore its c...
Ofer Arieli, Marc Denecker, Maurice Bruynooghe
VLDB
2005
ACM
93views Database» more  VLDB 2005»
15 years 9 months ago
Indexing Mixed Types for Approximate Retrieval
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
Liang Jin, Nick Koudas, Chen Li, Anthony K. H. Tun...
STACS
2007
Springer
15 years 10 months ago
Reachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman