Filters








12,334 Hits in 2.0 sec

Fast and flexible string matching by combining bit-parallelism and suffix automata

Gonzalo Navarro, Mathieu Raffinot
2000 ACM Journal of Experimental Algorithmics  
doi:10.1145/351827.384246 fatcat:nkeqj2micjf77g6tndi7an52le

A STT-Partition-Based Parallel Algorithm for Pattern Matching on GPU and CPU

Xudong Liu, Yanbing Liu, Jian Li, Jing Yu, Jianlong Tan
2015 International Journal of Computer and Communication Engineering  
Aho-Corasick (AC) is one of the most representative algorithms for multiple pattern matching.  ...  Experiments are carried out on three different datasets and results show that our method reduces the storage space by 45%~50% compared with state-of-the-art algorithms with comparable matching speed.  ...  We proposed a STT-Partition-based Parallel AC (SPAC) algorithm that partitions the automata and adopted the average length of pattern strings in rule sets as partition depth.  ... 
doi:10.17706/ijcce.2015.v4.387 fatcat:we6kecu5vffefjas4bbajuzkmm

BORDERS AND FINITE AUTOMATA

MARTIN ŠIMŮNEK, BOŘIVOJ MELICHAR
2007 International Journal of Foundations of Computer Science  
It is one of the basic stringology keystones used as a part of many algorithms in pattern matching, molecular biology, computerassisted music analysis and others.  ...  The paper discusses automata-theoretical background of Iliopoulos's ALL BORDERS algorithm that finds all borders of a string with don't care symbols.  ...  This research has been partially supported by the Ministry of Education, Youth, and Sport of the Czech Republic under research program MSM6840770014 and by the Czech Science Foundation as project No. 201  ... 
doi:10.1142/s0129054107005029 fatcat:y4cz3cbnhvaoff6qafqshqev6m

The Exact String Matching Problem: a Comprehensive Experimental Evaluation [article]

Simone Faro, Thierry Lecroq
2010 arXiv   pre-print
Since 1970 more than 80 string matching algorithms have been proposed, and more than 50% of them in the last ten years.  ...  In this note we present a comprehensive list of all string matching algorithms and present experimental results in order to compare them from a practical point of view.  ...  The list of the automata based string matching algorithms (1992-2009).  ... 
arXiv:1012.2547v1 fatcat:eie54bnkszeilbt5powdjwxz7i

On Two-Dimensional Pattern Matching by Finite Automata [chapter]

Jan Žd'árek, Bořivoj Melichar
2006 Lecture Notes in Computer Science  
The first of these two models presents an automata based version of the Bird and Baker approach with lower space complexity than the original algorithm.  ...  This paper presents a general concept of two-dimensional pattern matching using conventional (one-dimensional) finite automata.  ...  Based on the generic algorithm, a couple of automata based models and algorithms for 2D exact and 2D approximate pattern matching using a 2D Hamming distance are presented.  ... 
doi:10.1007/11605157_28 fatcat:bfub47zzubdbbnwevfjkpb6e5u

Page 476 of Computational Linguistics Vol. 30, Issue 4 [page]

2004 Computational Linguistics  
Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA. Kim, Jong Yong and John Shawe-Taylor. 1992. An approximate string-matching algorithm.  ...  Kim, Jong Yong and John Shawe-Taylor. 1994. Fast string matching using an n-gram algorithm. Software—Practice and Experience, 94(1):79-88. Kozen, Dexter C. 1997. Automata and Computability.  ... 

Cellular automata urban growth model calibration with genetic algorithms

Sharaf Al-Kheder, Jun Wang, Jie Shan
2007 2007 Urban Remote Sensing Joint Event  
Each rule set is evaluated in term of urban level and pattern match with reality.  ...  Proposed calibration algorithm is implemented to model the historical urban growth of Indianapolis-IN, USA. Urban growth results show a close match for both urban count and pattern with reality.  ...  as follows: In our calibration algorithm, the best six strings are copied directly (elitism) and crossed over to produce new 12 strings.  ... 
doi:10.1109/urs.2007.371826 fatcat:prnwefc33baejn5gtlkc3sbn54

Algorithm Design for Deterministic Finite Automata for a Given Regular Language with Prefix Strings

Rashandeep Singh, Dr. Gulshan Goyal
2022 Journal of scientific research  
Other applications of finite automata include pattern matching, speech and text processing, CPU machine operations, etc.  ...  Computer Science and Engineering have given us the field of automata theory, one of the largest areas that is concerned with the efficiency of an algorithm in solving a problem on a computational model  ...  The algorithm can benefit the novel learners in the field of automata theory and compiler design.  ... 
doi:10.37398/jsr.2022.660203 fatcat:lkokfoxdn5ampku7rkmicot4ei

A Novel Approach to Minimize DFA State Machines Using Linked List

Yogesh Pant
2018 International Journal of Scientific Research in Computer Sciences and Engineering  
Minimization of DFA works on the concept of DFA equivalence: Two DFA's are equivalent if and only if both accept the identical strings of same set.  ...  Standard algorithms from computational linear algebra are subjected to be used efficiently to solve the computational problems if a DFA recognize the set of encoded strings.  ...  The algorithms were thereafter implemented and their performance got recorded. The algorithms were examined on artificially produced data (strings and automata).  ... 
doi:10.26438/ijsrcse/v6i4.4145 fatcat:3pvzibpjvjfzboc6du3iswiawi

Page 3214 of Mathematical Reviews Vol. , Issue 98E [page]

1998 Mathematical Reviews  
In the present paper the authors prove that the fact that heads of the automata can go back and forth on strings, and especially on the pattern because most algorithms scan the text on line, seems to be  ...  String matching consists in finding whether a string of symbols x, called the pattern, occurs in another string of symbols y, the text.  ... 

Exact Online String Matching Bibliography [article]

Simone Faro
2016 arXiv   pre-print
Since 1970 more than 120 string matching algorithms have been proposed. In this note we present a comprehensive list of (almost) all string matching algorithms. The list is updated to May 2016.  ...  In this short note we present a comprehensive bibliography for the online exact string matching problem. The problem consists in finding all occurrences of a given pattern in a text.  ...  List of Algorithms based on Automata Also automata play a very important role in the design of efficient string matching algorithms.  ... 
arXiv:1605.05067v1 fatcat:2nr7bjtafjfmjgpfcfbyjnr6oq

Bit Parallel String Matching Algorithms: A Survey

Sumit Gupta, Akhtar Rasool
2014 International Journal of Computer Applications  
Some of the popular bit parallel string matching algorithms Shift OR, Shift OR with Q-Gram, BNDM, TNDM, SBNDM, LBNDM, FBNDM, BNDMq, and Multiple pattern BNDM.  ...  This paper discusses the working of various bit parallel string matching algorithms with example. Here we present how bit parallelism is useful for efficiency improvement in various algorithms.  ...  In 2010 Changsheng Miao, Guiran Chang and Xingwei combine the concept of Q gram with BNDM and implement exact multiple string matching algorithm known as Filtering based multiple string matching algorithm  ... 
doi:10.5120/16632-6501 fatcat:ae5v26ljrzcwlg32p22uc5hkvi

Generating Necklaces and Strings with Forbidden Substrings [chapter]

Frank Ruskey, Joe Sawada
2000 Lecture Notes in Computer Science  
Each of the algorithms runs in amortized time O(1) per string generated, independent of k, m, and n.  ...  Given a length m string f over a k-ary alphabet and a positive integer n, we develop e cient algorithms to generate (a) all k-ary strings of length n that have no substring equal to f, (b) all k-ary circular  ...  A more advanced algorithm will embed a real-time automata-based string matching algorithm into the string generation algorithm.  ... 
doi:10.1007/3-540-44968-x_33 fatcat:sm3bj7bouzbjjhytjspitvjsry

Approximate String Matching by Fuzzy Automata [chapter]

Václav Snášel, Aleš Keprt, Ajith Abraham, Aboul Ella Hassanien
2009 Man-Machine Interactions  
We explain new ways of constructing search algorithms using fuzzy sets and fuzzy automata.  ...  We continue with definition of our fuzzy automaton based approximate string matching algorithm, and add some notes to fuzzy-trellis construction which can be used for approximate searching.  ...  We continue with definition of our fuzzy automata based approximate matching algorithm, and add some notes to fuzzy-trellis construction which can be used for approximate searching.  ... 
doi:10.1007/978-3-642-00563-3_29 dblp:conf/icmmi/SnaselKAH09 fatcat:dtyfwa52m5bjdk5ihluobif5ry

A new problem in string searching [article]

George Havas, Jin Xian Lian
1994 arXiv   pre-print
At the match level, we consider Harrison signature, Karp-Rabin fingerprint, Bloom filter and automata based matching algorithms and present experimental performance figures.  ...  We suggest a two-level searching model: skip and match levels. We give two timestamp algorithms which skip searching parts of the text where there are no matches at all and prove their correctness.  ...  At the match level, we consider algorithms and data structures based on Harrison signatures, Karp-Rabin fingerprints, Bloom filters and automata.  ... 
arXiv:math/9406206v1 fatcat:3mcgrfvrpndq7jkwjzcototljy
« Previous Showing results 1 — 15 out of 12,334 results