NDLI: An Exact Data Mining Method for Finding Center Strings and All Their Instances

Content Provider	IEEE Xplore Digital Library
Author	Ruqian Lu Caiyan Jia Shaofang Zhang Lusheng Chen Hongyu Zhang
Copyright Year	1989
Abstract	Common substring problems allowing errors are known to be NP-hard. The main challenge of the problems lies in the combinatorial explosion of potential candidates. In this paper, we propose and study a generalized center string (GCS) problem, where not only all models (center strings) of any length, but also the positions of all their (degenerative) instances in input sequences are searched for. Inspired by frequent pattern mining techniques in data mining field, we present an exact and efficient method to solve GCS. First, a highly parallelized Trie-like structure, consensus tree, is proposed. Based on this structure, we present three Bpriori algorithms step by step. Bpriori algorithms can solve GCS with reasonable time and/or space complexities. We have proved that GCS is fixed parameter tractable with respect to fixed symbol set size and fixed length of input sequences. Experiment results on both artificial and real data have shown the correctness of the algorithms and the validity of our complexity analysis. A comparison with some current algorithms for solving common approximate substring problems is also given
Sponsorship	IEEE IEEE Comput. Soc. Tech. Committee on Data Eng IEEE Computer Society
File Size	2000585
File Format	PDF
ISSN	10414347
Volume Number	19
Issue Number	4
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-04-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Data mining Sequences Polynomials Content addressable storage Biology computing Computational biology Explosions Algorithm design and analysis Hamming distance Codes Bpriori algorithm. frequent pattern common approximate substring center string
Content Type	Text
Resource Type	Article
Subject	Information Systems Computational Theory and Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Novel algorithms for finding the closest l-mers in biological data

Novel algorithms for finding the closest l-mers in biological data

Finding approximate repetitions under Hamming distance

Consensus Strings with Small Maximum Distance and Small Distance Sum

Finding approximate repetitions under Hamming distance

Approximate Boyer-Moore String Matching for Small Alphabets

Counting Sequences with Large Local Distance

PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem

Hamming Distance Tolerant Content-Addressable Memory (HD-CAM) for Approximate Matching Applications

An Exact Data Mining Method for Finding Center Strings and All Their Instances

Similar Documents

Novel algorithms for finding the closest l-mers in biological data

Novel algorithms for finding the closest l-mers in biological data

Finding approximate repetitions under Hamming distance

Consensus Strings with Small Maximum Distance and Small Distance Sum

Finding approximate repetitions under Hamming distance

Approximate Boyer-Moore String Matching for Small Alphabets

Counting Sequences with Large Local Distance

PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem

Hamming Distance Tolerant Content-Addressable Memory (HD-CAM) for Approximate Matching Applications

An Exact Data Mining Method for Finding Center Strings and All Their Instances