<i>FPI</i> :  a novel indexing method using frequent patterns for approximate string searches

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Author and article information

Conference

Publisher: ACM

Publication date (Print): March 18 2013

Publication date (Online): March 18 2013

Publication date (Print): March 18 2013

Publication date (Electronic): March 18 2013

Pages: 397-403

Affiliations

[1 ]The University of Tokyo, Hitotsubashi, Chiyoda-ku, Tokyo, Japan

[2 ]National Institute of Informatics, Hitotsubashi, Chiyoda-ku, Tokyo, Japan

Article

DOI: 10.1145/2457317.2457390

SO-VID: c7f9b33f-bbfa-4491-a312-45f3af70d370

Conference name: EDBT/ICDT '13: Joint 2013 EDBT/ICDT Conferences

Conference acronym: EDBT/ICDT '13

Conference location: Genoa Italy

Conference date: 18 03 2013 22 03 2013

History

ScienceOpen disciplines: Quantitative & Systems biology,Biophysics

Data availability:

ScienceOpen disciplines: Quantitative & Systems biology, Biophysics

Comments

Comment on this article

scite_

Cited by 1

MIST: Top-k Approximate Sub-string Mining Using Triplet Statistical Significance
Authors: Sourav Dutta

See all cited by

FPI : a novel indexing method using frequent patterns for approximate string searches

Read this article at