Algorithms for string pattern discovery

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Pattern discovery from string data is an important problem with many applications. In this paper, we give a brief overview of our work on the optimal correlated pattern discovery problem, which integrates numerical attribute information into the string pattern discovery process. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Bannai, H. (2007). Algorithms for string pattern discovery. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4617 LNAI, pp. 24–29). Springer Verlag. https://doi.org/10.1007/978-3-540-73729-2_3

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