Sciweavers

1154 search results - page 28 / 231
» On the editing distance of graphs
Sort
View
EDBT
2009
ACM
241views Database» more  EDBT 2009»
14 years 3 months ago
GADDI: distance index based subgraph matching in biological networks
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
Shijie Zhang, Shirong Li, Jiong Yang
APPML
2006
71views more  APPML 2006»
13 years 8 months ago
Distance distribution of nodes in star graphs
The purpose of the paper is to provide an answer to a long standing problem to compute the distance distribution among the nodes in a star graph, i.e., to compute the exact number...
L. Wang, S. Subramanian, Shahram Latifi, Pradip K....
ICCBR
2009
Springer
14 years 3 months ago
Conceptual Neighborhoods for Retrieval in Case-Based Reasoning
Abstract. We present a case-based reasoning technique based on conceptual neighborhoods of cases. The system applies domain knowledge to the case retrieval process in the form of r...
Ben G. Weber, Michael Mateas
CMMR
2004
Springer
97views Music» more  CMMR 2004»
14 years 2 months ago
Evolutionary Optimization of Music Performance Annotation
In this paper we present an enhancement of edit distance based music performance annotation. The annotation captures musical expressivity not only in terms of timing deviations but...
Maarten Grachten, Josep Lluís Arcos, Ramon ...
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 10 months ago
Approximate String Matching: A Simpler Faster Algorithm
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
Richard Cole, Ramesh Hariharan