OMPPM: online multiple palindrome pattern matching
نویسندگان
چکیده
منابع مشابه
OMPPM: online multiple palindrome pattern matching
MOTIVATION A palindrome is a string that reads the same forward and backward. Finding palindromic substructures is important in DNA, RNA or protein sequence analysis. We say that two strings of the same length are pal-equivalent if, for each possible centre, they have the same length of the maximal palindrome. Given a text T of length n and a pattern P of length m, we study the palindrome patte...
متن کاملOnline Multiple Palindrome Pattern Matching
A palindrome is a string that reads the same forward and backward. We say that two strings of the same length are pal-equivalent if for each possible center they have the same length of the maximal palindrome. Given a text T of length n and a set of patterns P1, . . . , Pk, we study the online multiple palindrome pattern matching problem that finds all pairs of an index i and a pattern Pj such ...
متن کاملPalindrome Pattern Matching
A palindrome is a string that reads the same forward and backward. For a string x, let Pals(x) be the set of all maximal palindromes of x, where each maximal palindrome in Pals(x) is encoded by a pair (c, r) of its center c and its radius r. Given a text t of length n and a pattern p of length m, the palindrome pattern matching problem is to compute all positions i of t such that Pals(p) = Pals...
متن کاملOnline Abelian Pattern Matching
An abelian pattern describes the set of strings that comprise of the same combination of characters. Given an abelian pattern P and a text T ∈ Σ, the task is to find all occurrences of P in T , i.e. all substrings S = Ti...Tj such that the frequency of each character in S matches the specified frequency of that character in P . In this report we present simple online algorithms for abelian patt...
متن کاملMultiple Pattern Matching Revisited
We consider the classical exact multiple string matching problem. Our solution is based on q-grams combined with pattern superimposition, bit-parallelism and alphabet size reduction. We discuss the pros and cons of the various alternatives of how to achieve best combination. Our method is closely related to previous work by (Salmela et al., 2006). The experimental results show that our method p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2015
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/btv738