22,111 Hits in 3.7 sec

Indexed Hierarchical Approximate String Matching [chapter]

Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
2008 Lecture Notes in Computer Science  
We present a new search procedure for approximate string matching over suffix trees.  ...  We show that hierarchical verification, which is a well-established technique for on-line searching, can also be used with an indexed approach.  ...  This a very important result because it is the first algorithm that approximates the performance of the hybrid index automatically and effectively in practice.  ... 
doi:10.1007/978-3-540-89097-3_15 fatcat:qyyznrzfmnd4bcthjq4bkaonwa

Approximate String Matching Algorithms: A Brief Survey and Comparison

Syeda ShabnamHasan, Fareal Ahmed, Rosina Surovi Khan
2015 International Journal of Computer Applications  
While Brute Force performs approximate string matching based on distance measures of the query object from each string stored in the database, Lipschitz Embeddings uses a far more efficient approach which  ...  Ball Partitioning algorithm, much more efficient than Brute force but less efficient than Lipschitz algorithm, performs search in approximate string matching based on distances where queries operate on  ...  Oliveira, and Pedro Morales focused on indexed approximate string matching [2] .  ... 
doi:10.5120/21247-4048 fatcat:rem5wsd245e6fjwez4ksnt2bba


Qiang Zhang, Xiaocui Guo
2013 Biology of Sport  
In this paper, we represent a human motion hierarchical index structure and adopt a nonlinear method to segment motion sequences.  ...  KEY WORDS: motion capture, human hierarchical structure, motion pattern, KMP algorithm, motion retrieval The paper is organized as follows.  ...  The next function includes the information of local matching of the pattern strings.  ... 
doi:10.5604/20831862.1044460 pmid:24744481 pmcid:PMC3944581 fatcat:dpr2qo324rbuvcju7rsvhtsqbu

Automatic Processing of Document Annotations

J. Stevens, A. Gee, C. Dance
1998 Procedings of the British Machine Vision Conference 1998  
This procedure might have interesting applications in document database retrieval, since it allows an electronic document to be indexed by a printed version of itself.  ...  Figure 4 : 4 Approximate string matching by dynamic programming.  ...  The ASCII and printed text are represented by strings of word lengths (a), then matched using an approximate string matching algorithm (b).  ... 
doi:10.5244/c.12.44 dblp:conf/bmvc/StevensGD98 fatcat:hkd5trwywvhvvoamc4exwb2d7m

Compound descriptors in context

Douglas Tudhope, Ceri Binding, Dorothee Blocks, Daniel Cunliffe
2002 Proceedings of the second ACM/IEEE-CS joint conference on Digital libraries - JCDL '02  
The relevance of the approach to precoordinated indexing and matching faceted strings is discussed.  ...  The techniques can be applied both to unstructured multi-concept subject headings and potentially to more syntactically structured strings.  ...  permutations of index string term order to facilitate alphabetic lookup in a printed subject index [3] .  ... 
doi:10.1145/544220.544235 dblp:conf/jcdl/TudhopeBBC02 fatcat:dhbbsv4vivbzbjty6nfu5tzske

A Practical Index for Genome Searching [chapter]

Heikki Hyyrö, Gonzalo Navarro
2003 Lecture Notes in Computer Science  
Indexed Approximate String Matching The problem we focus on is: Given a long text T 1...n , and a (comparatively) short pattern P 1...m , both sequences over alphabet Σ of size σ, retrieve all substrings  ...  We push in the direction of obtaining maximum efficiency from an indexing scheme that does not lose any relevant match.  ...  The most successful approach to indexed approximate string matching [8] is called intermediate partitioning [3, 7] .  ... 
doi:10.1007/978-3-540-39984-1_26 fatcat:6jo5repwxff2tc5okuyfzuhibq

Mtssm - A Framework For Multi-Track Segmentation Of Symbolic Music

Brigitte Rafael, Stefan M. Oertl
2010 Zenodo  
The first layer of the MTSSM uses various string matching techniques to detect the best candidate segmentations for each track of a multi-track composition independently.  ...  Approximate String Matching The exact string matching algorithm achieves good results for structured tracks with a high number of (almost) identical repetitions of a pattern.  ...  For the first version of the MTSSM the authors chose to apply one exact string matching method using a correlative matrix and one approximate string matching method using dynamic programming.  ... 
doi:10.5281/zenodo.1080539 fatcat:ymdtq2ujnrbqboa756lzbheb3m

Approximate String Matching with Compressed Indexes

Luís M. Russo, Gonzalo Navarro, Arlindo Oliveira, Pedro Morales
2009 Algorithms  
In this paper we focus on indexed approximate string matching (ASM), which is of great interest, say, in bioinformatics.  ...  Finally, we improve hierarchical verification, a successful technique for sequential searching, so as to extend the matches of pattern pieces to the left or right.  ...  Hierarchical Approximate String Matching Bidirectional Compressed Indexes Our final algorithm can be implemented over any bidirectional index.  ... 
doi:10.3390/a2031105 fatcat:y5co44757jgi5eabwlslyutddu

Shape grammar extraction for efficient query-by-sketch pattern matching in long time series

Prithiviraj K. Muthumanickam, Katerina Vrotsou, Matthew Cooper, Jimmy Johansson
2016 2016 IEEE Conference on Visual Analytics Science and Technology (VAST)  
The steps depicted with green boxes are executed when a new input time series is loaded or when it undergoes hierarchical approximation, yellow boxes only when a new sketch is entered.  ...  A sketched pattern of interest is matched to the time-series data.  ...  This common representation is exploited for RE based string matching and hierarchical approximation of time series in the following sections.  ... 
doi:10.1109/vast.2016.7883518 dblp:conf/ieeevast/MuthumanickamVC16 fatcat:7g2v7qaoo5dqdhucll5z2y4xc4

Two birds with one stone: An efficient hierarchical framework for top-k and threshold-based string similarity search

Jin Wang, Guoliang Li, Dong Deng, Yong Zhang, Jianhua Feng
2015 2015 IEEE 31st International Conference on Data Engineering  
We first recursively partition strings into disjoint segments and build a hierarchical segment tree index (HS-Tree) on top of the segments. Then we utilize the HS-Tree to support similarity search.  ...  String similarity search is a fundamental operation in data cleaning and integration. It has two variants, thresholdbased string similarity search and top-k string similarity search.  ...  THE HIERARCHICAL SEGMENT INDEX In this section, we introduce a hierarchical segment tree (HS-Tree) to index the data strings.  ... 
doi:10.1109/icde.2015.7113311 dblp:conf/icde/WangLDZF15 fatcat:7vjtbvgn65a3vdxclyir5m64uq

Efficient Joinable Table Discovery in Data Lakes: A High-Dimensional Similarity-Based Approach [article]

Yuyang Dong, Kunihiro Takeoka, Chuan Xiao, Masafumi Oyamada
2021 arXiv   pre-print
A partitioning technique is developed to cope with the case when the data lake is large and the index cannot fit in main memory.  ...  vectors of Q and RV m the number of levels in a hierarchical grid I an inverted index Definition 1 (Vector Matching).  ...  "White" and "Black" yield equi-join results as strings exactly match in the two columns.  ... 
arXiv:2010.13273v4 fatcat:jg5g4jrqnfhpjelexhzwlk4ecy

Concurrent reading while writing II: The multi-writer case

Gary L. Peterson, James E. Burns
1987 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)  
The containment property is key to improving the search performance of hierarchical index structures like RE-trees: if a query string w is not contained in L(M), then it follows that w 6 2 L(M i ) for  ...  RE-trees are conceptually similar to other hierarchical, spatial index structures, like the R-tree [8] that is designed for indexing a collection of multi-dimensional rectangles, where each internal  ... 
doi:10.1109/sfcs.1987.15 dblp:conf/focs/PetersonB87 fatcat:iz2bxuxqajhqpju4fgyo47ehfe

A Survey Of Music Information Retrieval Systems

Rainer Typke, Frans Wiering, Remco C. Veltkamp
2005 Zenodo  
See Section 4.5 for an example of a MIR system with probabilistic matching. Indexing: Hierarchical Clustering Transition matrices can be organized as a tree.  ...  a state matching algorithm for approximate searching (Wu and Manber, 1992) .  ... 
doi:10.5281/zenodo.1417382 fatcat:niaxxv7z35e4zfdqlwmcvj2taq

4.-8. März 2019

Sabine Wehnert, Wolfram Fenske, Gunter Saake
2019 Datenbanksysteme für Business, Technologie und Web  
Despite the advantage of approximate string matching in full-text indexes, the data can also be stored as a graph.  ...  Hierarchical storage of the data, for example in JSON format, is therefore also an option for search in hierarchical data, especially when approximate string matching is required.  ... 
doi:10.18420/btw2019-ws-13 dblp:conf/btw/WehnertFS19 fatcat:ruzsjf3zbrcfrjzgcdntiqkyom

Average-Optimal Multiple Approximate String Matching [chapter]

Kimmo Fredriksson, Gonzalo Navarro
2003 Lecture Notes in Computer Science  
We present a new algorithm for multiple approximate string matching, based on an extension of the optimal (on average) singlepattern approximate string matching algorithm of Chang and Marr.  ...  Hence we fill an important gap in approximate string matching techniques, since no effective algorithms existed to search for many patterns with an intermediate difference ratio.  ...  In general, we find that methods designed for indexed approximate string matching can be adapted to (non-indexed) multiple approximate string matching.  ... 
doi:10.1007/3-540-44888-8_9 fatcat:alncs6my5jfsvg7vsbambqftay
« Previous Showing results 1 — 15 out of 22,111 results