scholarly journals An efficient data structure for dynamic two-dimensional reconfiguration

2017 ◽  
Vol 75 ◽  
pp. 15-25 ◽  
Author(s):  
Sándor P. Fekete ◽  
Jan-Marc Reinhardt ◽  
Christian Scheffer
Keyword(s):  
Data Structure ◽  
Two Dimensional ◽  
Efficient Data

Suffix array for multi-pattern matching with variable length wildcards

2021 ◽  
Vol 25 (2) ◽  
pp. 283-303
Author(s):  
Na Liu ◽  
Fei Xie ◽  
Xindong Wu
Keyword(s):  
Dynamic Programming ◽  
Data Structure ◽  
Pattern Matching ◽  
Edit Distance ◽  
State Of The Art ◽  
Suffix Array ◽  
Variable Length ◽  
Distance Method ◽  
Efficient Data ◽  
Comparison Algorithms

Approximate multi-pattern matching is an important issue that is widely and frequently utilized, when the pattern contains variable-length wildcards. In this paper, two suffix array-based algorithms have been proposed to solve this problem. Suffix array is an efficient data structure for exact string matching in existing studies, as well as for approximate pattern matching and multi-pattern matching. An algorithm called MMSA-S is for the short exact characters in a pattern by dynamic programming, while another algorithm called MMSA-L deals with the long exact characters by the edit distance method. Experimental results of Pizza & Chili corpus demonstrate that these two newly proposed algorithms, in most cases, are more time-efficient than the state-of-the-art comparison algorithms.

Storage-efficient data structure for large lookup dictionaries

1996 ◽  
Vol 58 (4) ◽  
pp. 201-206 ◽  
Author(s):  
Vishv M. Malhotra ◽  
Bala Srinivasan ◽  
Santosh Kulkarni
Keyword(s):  
Data Structure ◽  
Efficient Data

An efficient disk based data structure for rapid searching of quantitative two-dimensional gel databases

1993 ◽  
Vol 14 (1) ◽  
pp. 1341-1350 ◽  
Author(s):  
Peter F. Lemkin ◽  
Yecheng Wu ◽  
Kyle Upton
Keyword(s):  
Data Structure ◽  
Two Dimensional
Sign in / Sign up

Export Citation Format

Share Document