String matching with mismatches by real-valued FFT

Kensuke Baba

doi:10.1007/978-3-642-12189-0_24

String matching with mismatches by real-valued FFT

Kensuke Baba

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Citations (Scopus)

Abstract

String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string matching with mismatches, which computes an estimate with accuracy. The algorithm consists of FFT computations for binary vectors which can be computed faster than the computation for vectors of complex numbers. Therefore, a reduction of the computation time is obtained by the speed-up for FFT, which leads an improvement of the variance of the estimates. This paper analyzes the variance of the estimates in the algorithm and compares it with the variances in existing algorithms.

Original language	English
Title of host publication	Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings
Publisher	Springer Verlag
Pages	273-283
Number of pages	11
Edition	PART 4
ISBN (Print)	3642121888, 9783642121883
DOIs	https://doi.org/10.1007/978-3-642-12189-0_24
Publication status	Published - 2010
Externally published	Yes
Event	2010 International Conference on Computational Science and Its Applications, ICCSA 2010 - Fukuoka, Japan Duration: Mar 23 2010 → Mar 26 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 4
Volume	6019 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	2010 International Conference on Computational Science and Its Applications, ICCSA 2010
Country/Territory	Japan
City	Fukuoka
Period	3/23/10 → 3/26/10

Keywords

FFT
Randomized algorithm
String matching with mismatches

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-12189-0_24

Cite this

Baba, K. (2010). String matching with mismatches by real-valued FFT. In Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings (PART 4 ed., pp. 273-283). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6019 LNCS, No. PART 4). Springer Verlag. https://doi.org/10.1007/978-3-642-12189-0_24

String matching with mismatches by real-valued FFT. / Baba, Kensuke.

Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings. PART 4. ed. Springer Verlag, 2010. p. 273-283 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6019 LNCS, No. PART 4).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Baba, K 2010, String matching with mismatches by real-valued FFT. in Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings. PART 4 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 4, vol. 6019 LNCS, Springer Verlag, pp. 273-283, 2010 International Conference on Computational Science and Its Applications, ICCSA 2010, Fukuoka, Japan, 3/23/10. https://doi.org/10.1007/978-3-642-12189-0_24

Baba K. String matching with mismatches by real-valued FFT. In Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings. PART 4 ed. Springer Verlag. 2010. p. 273-283. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 4). doi: 10.1007/978-3-642-12189-0_24

@inproceedings{71c7e3a96ebd4c0fa1adcf35cb6d0c0e,

title = "String matching with mismatches by real-valued FFT",

abstract = "String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string matching with mismatches, which computes an estimate with accuracy. The algorithm consists of FFT computations for binary vectors which can be computed faster than the computation for vectors of complex numbers. Therefore, a reduction of the computation time is obtained by the speed-up for FFT, which leads an improvement of the variance of the estimates. This paper analyzes the variance of the estimates in the algorithm and compares it with the variances in existing algorithms.",

keywords = "FFT, Randomized algorithm, String matching with mismatches",

author = "Kensuke Baba",

year = "2010",

doi = "10.1007/978-3-642-12189-0_24",

language = "English",

isbn = "3642121888",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

number = "PART 4",

pages = "273--283",

booktitle = "Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings",

edition = "PART 4",

note = "2010 International Conference on Computational Science and Its Applications, ICCSA 2010 ; Conference date: 23-03-2010 Through 26-03-2010",

}

TY - GEN

T1 - String matching with mismatches by real-valued FFT

AU - Baba, Kensuke

PY - 2010

Y1 - 2010

N2 - String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string matching with mismatches, which computes an estimate with accuracy. The algorithm consists of FFT computations for binary vectors which can be computed faster than the computation for vectors of complex numbers. Therefore, a reduction of the computation time is obtained by the speed-up for FFT, which leads an improvement of the variance of the estimates. This paper analyzes the variance of the estimates in the algorithm and compares it with the variances in existing algorithms.

AB - String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string matching with mismatches, which computes an estimate with accuracy. The algorithm consists of FFT computations for binary vectors which can be computed faster than the computation for vectors of complex numbers. Therefore, a reduction of the computation time is obtained by the speed-up for FFT, which leads an improvement of the variance of the estimates. This paper analyzes the variance of the estimates in the algorithm and compares it with the variances in existing algorithms.

KW - FFT

KW - Randomized algorithm

KW - String matching with mismatches

UR - http://www.scopus.com/inward/record.url?scp=77952294086&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77952294086&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-12189-0_24

DO - 10.1007/978-3-642-12189-0_24

M3 - Conference contribution

AN - SCOPUS:77952294086

SN - 3642121888

SN - 9783642121883

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 273

EP - 283

BT - Computational Science and Its Applications - ICCSA 2010 - International Conference, Proceedings

PB - Springer Verlag

T2 - 2010 International Conference on Computational Science and Its Applications, ICCSA 2010

Y2 - 23 March 2010 through 26 March 2010

ER -

String matching with mismatches by real-valued FFT

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this