Access the full text.
Sign up today, get DeepDyve free for 14 days.
C. Iliopoulos, L. Mouchard, Mohammad Rahman (2008)
A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern MatchingMathematics in Computer Science, 1
René Rahn, D. Weese, K. Reinert (2014)
Journaled string tree - a scalable data structure for analyzing thousands of similar genomes on your laptopBioinformatics, 30 24
Huy Do, J. Jansson, K. Sadakane, W. Sung (2012)
Fast Relative Lempel-Ziv Self-index for Similar Sequences
Markus Fritz, R. Leinonen, G. Cochrane, E. Birney (2011)
Efficient storage of high throughput DNA sequencing data using reference-based compression.Genome research, 21 5
S. Faro, T. Lecroq (2009)
Efficient Variants of the Backward-Oracle-Matching AlgorithmInt. J. Found. Comput. Sci., 20
(2012)
High frequency of potentially causative SORL1 mutations in autosomal dominant early-onset alzheimer disease
A. Amir, Moshe Lewenstein, E. Porat (2000)
Faster algorithms for string matching with k mismatchesJ. Algorithms, 50
J. Na, Heejin Park, M. Crochemore, J. Holub, C. Iliopoulos, L. Mouchard, Kunsoo Park (2013)
Suffix Tree of Alignment: An Efficient Index for Similar DataArXiv, abs/1305.1744
F. Franek, C. Jennings, W. Smyth (2005)
A simple fast hybrid pattern-matching algorithmJ. Discrete Algorithms, 5
Ali Alatabbi, Carl Barton, C. Iliopoulos, L. Mouchard (2012)
Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations
Shanika Kuruppu, S. Puglisi, J. Zobel (2010)
Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and RetrievalString Processing and Information Retrieval, 6393
Xia Cao, Shuai Li, A. Tung (2005)
Indexing DNA Sequences Using q-Grams
Ali Alatabbi, Carl Barton, C. Iliopoulos (2012)
On the repetitive collection indexing problem2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops
(1975)
Efficient string matching: an aid to bibliographic search
Songbo Huang, T. Lam, W. Sung, Siu-Lung Tam, S. Yiu (2010)
Indexing Similar DNA Sequences
François Panneton, P. L'Ecuyer, M. Matsumoto (2004)
Improved long-period generators based on linear recurrences modulo 2ACM Trans. Math. Softw., 32
A Amir, M Lewenstein, E Porat (2004)
Faster algorithms for string matching with $$k$$ k mismatchesJ. Algorithms, 50
S. Faro, T. Lecroq (2013)
The exact online string matching problem: A review of the most recent resultsACM Comput. Surv., 45
M. Crochemore, C. Hancart, T. Lecroq (2007)
Algorithms on strings
J. Na, Heejin Park, Sunho Lee, Minsung Hong, T. Lecroq, L. Mouchard, Kunsoo Park (2013)
Suffix Array of Alignment: A Practical Index for Similar Data
D. Knuth, James Morris, V. Pratt (1977)
Fast Pattern Matching in StringsSIAM J. Comput., 6
We consider the problem of on-line exact string matching of a pattern in a set of highly similar sequences. This can be useful in cases where indexing the sequences is not feasible. We present a preliminary study by restricting the problem for a specific case where we adapt the classical Morris-Pratt and Knuth-Morris-Pratt algorithms to consider borders with errors. We give an original algorithm for computing borders at Hamming distance 1. We exhibit experimental results showing that our algorithms are much faster than searching for the pattern in each sequences with a very fast on-line exact string matching algorithm.
Mathematics in Computer Science – Springer Journals
Published: Feb 2, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.