Sciweavers

274 search results - page 19 / 55
» Approximating Edit Distance Efficiently
Sort
View
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
14 years 2 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
14 years 10 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
CAD
2008
Springer
13 years 10 months ago
Detecting approximate symmetries of discrete point subsets
Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid mod...
Ming Li, Frank C. Langbein, Ralph R. Martin
ESWS
2009
Springer
14 years 4 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
CPM
2009
Springer
121views Combinatorics» more  CPM 2009»
14 years 4 months ago
LCS Approximation via Embedding into Local Non-repetitive Strings
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
Gad M. Landau, Avivit Levy, Ilan Newman