| |
Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > Nonnumerical Algorithms And Problems (F.2.2) > Pattern Matching (F.2.2...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 53
Reviews about "Pattern Matching (F.2.2...)":
|
Date Reviewed |
| |
Locating maximal approximate runs in a string
Amit M., Crochemore M., Landau G., Sokol D. Theoretical Computer Science 700 45-62, 2017. Type: Article
Repetition and periodicity play an essential role in efficient pattern matching, data analysis, and data compression. This paper presents an efficient algorithm to identify maximal sequences of approximate repetitions within a string, ...
|
Jul 3 2018 |
| |
In-place algorithms for exact and approximate shortest unique substring problems
Hon W., Thankachan S., Xu B. Theoretical Computer Science 690 12-25, 2017. Type: Article
The problem of exact shortest unique substring (SUS) is formulated as follows:...
|
Dec 27 2017 |
| |
Indexing methods for approximate dictionary searching: comparative analysis
Boytsov L. Journal of Experimental Algorithmics 161.1-1.91, 2011. Type: Article
Anyone who has ever searched for a word (pattern) in a file or checked documents for spelling errors appreciates efficient algorithms that can quickly find relevant occurrences of the pattern, even if it is inexact or incomplete. This ...
|
Aug 18 2011 |
| |
Hausdorff distance under translation for points and balls
Agarwal P., Har-Peled S., Sharir M., Wang Y. ACM Transactions on Algorithms 6(4): 1-26, 2010. Type: Article
In the protein docking problem, pairs of molecules modeled as unions of balls are shape-matched by finding close but noncolliding positionings of the molecules. This provides one motivation for this work, which develops algorithms for ...
|
Nov 18 2010 |
| |
External memory algorithms for string problems
Roh K., Crochemore M., Iliopoulos C., Park K. Fundamenta Informaticae 84(1): 17-32, 2008. Type: Article
Modern systems typically use a cheaper external memory with a high storage capacity. Since access to this memory is relatively slow compared to the internal memory, applications that process huge amounts of data need to minimize commun...
|
Apr 15 2009 |
| |
A multi-matcher for ear authentication
Nanni L., Lumini A. Pattern Recognition Letters 28(16): 2219-2226, 2007. Type: Article
The shape of the human ear is one personal characteristic that can be used in a biometric authentication system, using two-dimensional (2D) images obtained from the ear. Although biometric authentication based on physical properties, l...
|
Mar 7 2008 |
| |
Extracting constrained 2-interval subsets in 2-interval sets
Blin G., Fertin G., Vialette S. Theoretical Computer Science 385(1-3): 241-263, 2007. Type: Article
Ribonucleic acid (RNA) is a very special organic molecule. Understanding the structural repertoire of RNA secondary motifs is a very hot and active research area. Many people have come up with different novel representations for RNA se...
|
Feb 29 2008 |
| |
Efficient mining of generalized association rules with non-uniform minimum support
Tseng M., Lin W. Data & Knowledge Engineering 62(1): 41-64, 2007. Type: Article
An important area of business data mining is the determination of association rules via the analysis of large databases of transaction records that contain item sets, for example from sales. In this fine paper, the authors propel the r...
|
Aug 16 2007 |
| |
 Insufficiency of four known necessary conditions on string unavoidability
Heitsch C. Journal of Algorithms 56(2): 96-123, 2005. Type: Article
Pattern matching is difficult. If you’ve ever doubted this, consider string unavoidability, the topic of this paper....
|
May 8 2006 |
| |
Handbook of exact string matching algorithms
Charras C., Lecroq T., King’s College Publications, 2004. 238 pp. Type: Book (9780954300647)
String matching has a wide variety of uses, both within computer science and in computer applications from business to science. This book covers string matching in 40 short chapters. After an introductory chapter, each succeeding chapt...
|
Jul 21 2005 |
| |
|
|
| |
|
|
