Skip to main content
Conference ProceedingsOPEN ACCESS

A new algorithm for fast all-against-all substring matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4209 LNCS 360-366
DOI: 10.1007/11880561_31
1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a new and efficient algorithm to solve the 'threshold all vs. all' problem, which involves searching of two strings (with length N and M respectively) for finding all maximal approximate matches of length at least S and with up to K differences. The algorithm is based on a novel graph model, and it solves the problem in time O(N M K2). © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Barsky, M., Stege, U., Thomo, A., & Upton, C. (2006). A new algorithm for fast all-against-all substring matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4209 LNCS, pp. 360–366). Springer Verlag. https://doi.org/10.1007/11880561_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free