Skip header Section
Skip Bibliometrics Section
Pattern matching algorithmsMay 1997
- Editors:
- Alberto Apostolico,
- Zvi Galil
Abstract
No abstract available.
Cited By
- Charalampopoulos P, Gawrychowski P, Mozes S and Weimann O On the Hardness of Computing the Edit Distance of Shallow Trees String Processing and Information Retrieval, (290-302)
- Zeng D, Liu Y, Yan P and Yang Y (2021). Location-Aware Real-Time Recommender Systems for Brick-and-Mortar Retailers, INFORMS Journal on Computing, 33:4, (1608-1623), Online publication date: 1-Oct-2021.
- Brimkov V, Barneva R and Kanev K Dealing with Noise in Cluster Pattern Interface Combinatorial Image Analysis, (236-244)
- Ergün F, Grigorescu E, Sadeqi Azer E and Zhou S (2019). Periodicity in Data Streams with Wildcards, Theory of Computing Systems, 64:1, (177-197), Online publication date: 1-Jan-2020.
- Férée H, Åman Pohjola J, Kumar R, Owens S, Myreen M and Ho S Program Verification in the Presence of I/O Verified Software. Theories, Tools, and Experiments, (88-111)
- Ergün F, Grigorescu E, Sadeqi Azer E and Zhou S Periodicity in Data Streams with Wildcards Computer Science – Theory and Applications, (90-105)
- Bringmann K, Gawrychowski P, Mozes S and Weimann O Tree edit distance cannot be computed in strongly subcubic time (unless APSP can) Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (1190-1206)
- Guerrini F, Gnutti A and Leonardi R (2017). Even/odd decomposition made sparse, Signal Processing, 141:C, (273-286), Online publication date: 1-Dec-2017.
- Grigorescu E, Azer E and Zhou S Longest alignment with edits in data streams 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), (405-412)
Kouzinopoulos C and Margaritis K (2013). Exact online two-dimensional pattern matching using multiple pattern matching algorithms, ACM Journal of Experimental Algorithmics, 18, (2.1-2.34), Online publication date: 1-Dec-2013.- Mendivelso J, Lee I and Pinzón Y Approximate function matching under δ- and γ- distances Proceedings of the 19th international conference on String Processing and Information Retrieval, (348-359)
- Viyanon W and Madria S XML-SIM-CHANGE Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II, (1061-1078)
- Demaine E, Mozes S, Rossman B and Weimann O (2009). An optimal decomposition algorithm for tree edit distance, ACM Transactions on Algorithms, 6:1, (1-19), Online publication date: 1-Dec-2009.
- Viyanon W and Madria S XML-SIM Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part II, (1183-1200)
- Mostafa N and Krintz C Tracking performance across software revisions Proceedings of the 7th International Conference on Principles and Practice of Programming in Java, (162-171)
- Ecker A and Ullman S (2009). A hierarchical non-parametric method for capturing non-rigid deformations, Image and Vision Computing, 27:1-2, (87-98), Online publication date: 1-Jan-2009.
- Apostolico A and Tagliacollo C (2008). Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n2logn) time, Theoretical Computer Science, 408:2-3, (106-115), Online publication date: 20-Nov-2008.
- Apostolico A and Tagliacollo C Incremental discovery of irredundant motif bases in time O(|Σ|n2 log n) Proceedings of the 7th international conference on Algorithms in Bioinformatics, (136-148)
- Bonarini A, Matteucci M and Restelli M (2007). Problems and solutions for anchoring in multi-robot applications, Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology, 18:3, (245-254), Online publication date: 1-Aug-2007.
- Apostolico A and Tagliacollo C Optimal offline extraction of irredundant motif bases Proceedings of the 13th annual international conference on Computing and Combinatorics, (360-371)
- Demaine E, Mozes S, Rossman B and Weimann O An optimal decomposition algorithm for tree edit distance Proceedings of the 34th international conference on Automata, Languages and Programming, (146-157)
- Kim M and Notkin D Program element matching for multi-version program analyses Proceedings of the 2006 international workshop on Mining software repositories, (58-64)
- Araújo E and Soares J Scoring matrices that induce metrics on sequences Proceedings of the 7th Latin American conference on Theoretical Informatics, (68-79)
- Guha S, Jagadish H, Koudas N, Srivastava D and Yu T (2006). Integrating XML data sources using approximate joins, ACM Transactions on Database Systems, 31:1, (161-207), Online publication date: 1-Mar-2006.
- Apostolico A, Comin M and Parida L Bridging lossy and lossless compression by motif pattern discovery General Theory of Information Transfer and Combinatorics, (793-813)
- Efraty N and Landau G (2005). Sparse Normalized Local Alignment, Algorithmica, 43:3, (179-194), Online publication date: 1-Nov-2005.
- Garofalakis M and Kumar A (2005). XML stream processing using tree-edit distance embeddings, ACM Transactions on Database Systems, 30:1, (279-332), Online publication date: 1-Mar-2005.
- Amir A and Nor I Generalized Function Matching Algorithms and Computation, (41-52)
- Höchsmann M, Töller T, Giegerich R and Kurtz S Local Similarity in RNA Secondary Structures Proceedings of the IEEE Computer Society Conference on Bioinformatics
- Yamamoto H and Miyazaki T A fast bit-parallel algorithm for matching extended regular expressions Proceedings of the 9th annual international conference on Computing and combinatorics, (222-231)
- Amir A, Butman A, Crochemore M, Landau G and Schaps M Two-dimensional pattern matching with rotations Proceedings of the 14th annual conference on Combinatorial pattern matching, (17-31)
- Garofalakis M and Kumar A Correlating XML data streams using tree-edit distance embeddings Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (143-154)
- Kärkkäinen J, Navarro G and Ukkonen E (2003). Approximate string matching on Ziv-Lempel compressed text, Journal of Discrete Algorithms, 1:3-4, (313-338), Online publication date: 1-Jun-2003.
- Guha S, Jagadish H, Koudas N, Srivastava D and Yu T Approximate XML joins Proceedings of the 2002 ACM SIGMOD international conference on Management of data, (287-298)
- Apostolico A, Bock M and Lonardi S Monotony of surprise and large-scale quest for unusual words Proceedings of the sixth annual international conference on Computational biology, (22-31)
- Dumitrescu S, Wu X and Wang Z Globally Optimal Uneven Error-Protected Packetization of Scalable Code Streams Proceedings of the Data Compression Conference
- Apostolico A and Crochemore M String pattern matching for a deluge survival kit Handbook of massive data sets, (151-194)
- Jung J, Yoon J and Jo G Collaborative information filtering by using categorized bookmarks on the web Proceedings of the Applications of prolog 14th international conference on Web knowledge management and decision support, (237-250)
- Du W and Atallah M Secure multi-party computation problems and their applications Proceedings of the 2001 workshop on New security paradigms, (13-22)
- Navarro G, Kida T, Takeda M, Shinohara A and Arikawa S Faster Approximate String Matching over Compressed Text Proceedings of the Data Compression Conference
- Amir A, Cole R, Hariharan R, Lewenstein M and Porat E Overlap matching Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, (279-288)
- Moh C, Lim E and Ng W Re-engineering structures from Web documents Proceedings of the fifth ACM conference on Digital libraries, (67-76)
- Apostolico A and Bejerano G Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space Proceedings of the fourth annual international conference on Computational molecular biology, (25-32)
- Alstrup S, Brodal G and Rauhe T Pattern matching in dynamic texts Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (819-828)
- Nayak D and Walker D Simulation-Based Design Error Diagnosis and Correction in Combinational Digital Circuits Proceedings of the 1999 17TH IEEE VLSI Test Symposium
- Garofalakis M, Ioannidis Y and Özden B Resource Scheduling for Composite Multimedia Objects Proceedings of the 24rd International Conference on Very Large Data Bases, (74-85)
Index Terms
- Pattern matching algorithms
Recommendations
Exact online two-dimensional pattern matching using multiple pattern matching algorithms
Baker and Bird and Baeza-Yates and Regnier are two of the most efficient and widely used algorithms for exact online two-dimensional pattern matching. Both use the automaton of the Aho-Corasick multiple pattern matching algorithm to locate all the ...
Order-preserving pattern matching with scaling
AbstractGiven a text T and a pattern P, the order-preserving pattern matching (OPPM for short) problem is to find all substrings of T which have the same relative orders as P. Recently, approximate OPPM that allows errors have been studied ...
Highlights- We propose a novel criteria for approximate order-preserving pattern matching.
- ...
Revisiting multiple pattern matching algorithms for multi-core architecture
Special issue on Community Analysis and Information RecommendationDue to the huge size of patterns to be searched, multiple pattern searching remains a challenge to several newly-arising applications like network intrusion detection. In this paper, we present an attempt to design efficient multiple pattern searching ...