scholarly journals Lightweight Distributed Suffix Array Construction

2019 ◽  
pp. 27-38 ◽  
Author(s):  
Johannes Fischer ◽  
Florian Kurpicz
Keyword(s):  
Suffix Array

An Efficient Tool for Searching Maximal and Super Maximal Repeats in Large DNA/Protein Sequences via Induced-Enhanced Suffix Array

2019 ◽  
Vol 12 (2) ◽  
pp. 128-134
Author(s):  
Sanjeev Kumar ◽  
Suneeta Agarwal ◽  
Ranvijay
Keyword(s):  
Protein Sequences ◽  
Input Sequence ◽  
Suffix Array ◽  
Secondary Memory ◽  
Time And Space ◽  
Efficient Tool ◽  
Frequency Distributions ◽  
Alignment Algorithms ◽  
Common Prefix ◽  
Art Works

Background: DNA and Protein sequences of an organism contain a variety of repeated structures of various types. These repeated structures play an important role in Molecular biology as they are related to genetic backgrounds of inherited diseases. They also serve as a marker for DNA mapping and DNA fingerprinting. Efficient searching of maximal and super maximal repeats in DNA/Protein sequences can lead to many other applications in the area of genomics. Moreover, these repeats can also be used for identification of critical diseases by finding the similarity between frequency distributions of repeats in viruses and genomes (without using alignment algorithms). Objective: The study aims to develop an efficient tool for searching maximal and super maximal repeats in large DNA/Protein sequences. Methods: The proposed tool uses a newly introduced data structure Induced Enhanced Suffix Array (IESA). IESA is an extension of enhanced suffix array. It uses induced suffix array instead of classical suffix array. IESA consists of Induced Suffix Array (ISA) and an additional array-Longest Common Prefix (LCP) array. ISA is an array of all sorted suffixes of the input sequence while LCP array stores the lengths of the longest common prefixes between all pairs of consecutive suffixes in an induced suffix array. IESA is known to be efficient w.r.t. both time and space. It facilitates the use of secondary memory for constructing the large suffix-array. Results: An open source standalone tool named MSR-IESA for searching maximal and super maximal repeats in DNA/Protein sequences is provided at https://github.com/sanjeevalg/MSRIESA. Experimental results show that the proposed algorithm outperforms other state of the art works w.r.t. to both time and space. Conclusion: The proposed tool MSR-IESA is remarkably efficient for the analysis of DNA/Protein sequences, having maximal and super maximal repeats of any length. It can be used for identification of well-known diseases.

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.

Evaluation of fast spoken term detection using a suffix array

2011 ◽  
Author(s):  
Kouichi Katsurada ◽  
Shinta Sawada ◽  
Shigeki Teshima ◽  
Yurie Iribe ◽  
Tsuneo Nitta
Keyword(s):  
Suffix Array ◽  
Spoken Term Detection

scholarly journals GHOSTX: An Improved Sequence Homology Search Algorithm Using a Query Suffix Array and a Database Suffix Array

PLoS ONE ◽  
2014 ◽  
Vol 9 (8) ◽  
pp. e103833 ◽  
Author(s):  
Shuji Suzuki ◽  
Masanori Kakuta ◽  
Takashi Ishida ◽  
Yutaka Akiyama
Keyword(s):  
Sequence Homology ◽  
Search Algorithm ◽  
Suffix Array ◽  
Homology Search

scholarly journals Parallel lightweight wavelet tree, suffix array and FM-index construction

2017 ◽  
Vol 43 ◽  
pp. 2-17 ◽  
Author(s):  
Julian Labeit ◽  
Julian Shun ◽  
Guy E. Blelloch
Keyword(s):  
Suffix Array ◽  
Index Construction

scholarly journals SACABench: Benchmarking Suffix Array Construction

2019 ◽  
pp. 407-416
Author(s):  
Johannes Bahne ◽  
Nico Bertram ◽  
Marvin Böcker ◽  
Jonas Bode ◽  
Johannes Fischer ◽  
...  
Keyword(s):  
Suffix Array

scholarly journals Engineering Augmented Suffix Sorting Algorithms

2018 ◽  
Author(s):  
Felipe A. Louza ◽  
Guilherme P. Telles ◽  
Simon Gog
Keyword(s):  
Computer Science ◽  
Full Text ◽  
Suffix Array ◽  
Optimal Time ◽  
Time And Space ◽  
Sorting Algorithms ◽  
Constant Size ◽  
Common Prefix ◽  
Efficient Processing ◽  
Burrows Wheeler Transform

Strings are prevalent in Computer Science and algorithms for their efficient processing are fundamental in various applications. The results introduced in this work contribute with theoretical improvements and practical advances in building full-text indexes. Our first contribution is an in-place algorithm that computes the Burrows-Wheeler transform and the longest common prefix (LCP) array. Our second contribution is the construction of the suffix array augmented with the LCP array in optimal time and space for strings from constant size alphabets. Our third contribution is a set of algorithms to construct full-text indexes for string collections in optimal theoretical bounds. This work is an extended abstract of the Ph.D. thesis of the first author.

Sign in / Sign up

Export Citation Format

Share Document