Sciweavers

IPL
2008
87views more  IPL 2008»
13 years 4 months ago
Optimal prefix and suffix queries on texts
Abstract. In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied M
Maxime Crochemore, Costas S. Iliopoulos, Mohammad ...
WALCOM
2007
IEEE
109views Algorithms» more  WALCOM 2007»
13 years 5 months ago
Pattern Matching in Degenerate DNA/RNA Sequences
In this paper, we consider the pattern matching problem in DNA and RNA sequences where either the pattern or the text can be degenerate i.e. contain sets of characters. We present ...
M. Sohel Rahman, Costas S. Iliopoulos, Laurent Mou...
WALCOM
2008
IEEE
95views Algorithms» more  WALCOM 2008»
13 years 5 months ago
Indexing Circular Patterns
This paper deals with the Circular Pattern Matching Problem (CPM). In CPM, we are interested in pattern matching between the text T and the circular pattern C(P) of a given pattern...
Costas S. Iliopoulos, M. Sohel Rahman
COCOON
2006
Springer
13 years 8 months ago
Finding Patterns with Variable Length Gaps or Don't Cares
In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gap...
M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, ...
ISAAC
2001
Springer
98views Algorithms» more  ISAAC 2001»
13 years 8 months ago
Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
Hideaki Hori, Shinichi Shimozono, Masayuki Takeda,...
FCT
2005
Springer
13 years 9 months ago
A New Linearizing Restriction in the Pattern Matching Problem
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
Yo-Sub Han, Derick Wood
MFCS
2007
Springer
13 years 10 months ago
Finding Patterns in Given Intervals
In this paper, we study the pattern matching problem in given intervals. Depending on whether the intervals are given a priori for pre-processing, or during the query along with th...
Maxime Crochemore, Costas S. Iliopoulos, M. Sohel ...
ACMSE
2009
ACM
13 years 10 months ago
FI-based file access predictor
An algorithm is proposed for the purpose of optimizing the availability of files to an operating system prior to their being required during execution by a running system. This al...
Jinsuk Baek, Paul S. Fisher, Mingyung Kwak
LATA
2009
Springer
13 years 11 months ago
Counting Parameterized Border Arrays for a Binary Alphabet
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a text when there exists a renaming bijection on the alp...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...