NDLI: qPMS7: A Fast Algorithm for Finding (ℓ, d)-Motifs in DNA and Protein Sequences

Content Provider	PubMed Central
Author	Dinh, Hieu Rajasekaran, Sanguthevar Davila, Jaime
Editor	Vladimir, Brusic
Copyright Year	2012
Abstract	Detection of rare events happening in a set of DNA/protein sequences could lead to new biological discoveries. One kind of such rare events is the presence of patterns called motifs in DNA/protein sequences. Finding motifs is a challenging problem since the general version of motif search has been proven to be intractable. Motifs discovery is an important problem in biology. For example, it is useful in the detection of transcription factor binding sites and transcriptional regulatory elements that are very crucial in understanding gene function, human disease, drug design, etc. Many versions of the motif search problem have been proposed in the literature. One such is the -motif search (or Planted Motif Search (PMS)). A generalized version of the PMS problem, namely, Quorum Planted Motif Search (qPMS), is shown to accurately model motifs in real data. However, solving the qPMS problem is an extremely difficult task because a special case of it, the PMS Problem, is already NP-hard, which means that any algorithm solving it can be expected to take exponential time in the worse case scenario. In this paper, we propose a novel algorithm named qPMS7 that tackles the qPMS problem on real data as well as challenging instances. Experimental results show that our Algorithm qPMS7 is on an average 5 times faster than the state-of-art algorithm. The executable program of Algorithm qPMS7 is freely available on the web at http://pms.engr.uconn.edu/downloads/qPMS7.zip. Our online motif discovery tools that use Algorithm qPMS7 are freely available at http://pms.engr.uconn.edu or http://motifsearch.com.
Related Links	http://dx.doi.org/10.1371/journal.pone.0041425
Starting Page	41425
File Format	PDF
ISSN	19326203
e-ISSN	19326203
Journal	PLoS ONE
Issue Number	7
Volume Number	7
Language	English
Publisher	Public Library of Science
Publisher Date	2012-07-01
Access Restriction	Open
Rights Holder	Public Library of Science
Subject Keyword	Biochemistry, Genetics and Molecular Biology(all) Agricultural and Biological Sciences(all) Medicine(all) Research in Higher Education
Content Type	Text
Resource Type	Article
Subject	Multidisciplinary

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

Fast and Accurate Discovery of Degenerate Linear Motifs in Protein Sequences

Finding Sequences for over 270 Orphan Enzymes

Adaptive GDDA-BLAST: Fast and Efficient Algorithm for Protein Sequence Embedding

A Fast and Scalable Kymograph Alignment Algorithm for Nanochannel-Based Optical DNA Mappings

A New Exhaustive Method and Strategy for Finding Motifs in ChIP-Enriched Regions

PairMotif: A New Pattern-Driven Algorithm for Planted (l, d) DNA Motif Search

A Simple Algorithm for Finding All k-Edge-Connected Components

DNA Sequences at a Glance

FctClus: A Fast Clustering Algorithm for Heterogeneous Information Networks

qPMS7: A Fast Algorithm for Finding (ℓ, d)-Motifs in DNA and Protein Sequences

Similar Documents

Fast and Accurate Discovery of Degenerate Linear Motifs in Protein Sequences

Finding Sequences for over 270 Orphan Enzymes

Adaptive GDDA-BLAST: Fast and Efficient Algorithm for Protein Sequence Embedding

A Fast and Scalable Kymograph Alignment Algorithm for Nanochannel-Based Optical DNA Mappings

A New Exhaustive Method and Strategy for Finding Motifs in ChIP-Enriched Regions

PairMotif: A New Pattern-Driven Algorithm for Planted (l, d) DNA Motif Search

A Simple Algorithm for Finding All k-Edge-Connected Components

DNA Sequences at a Glance

FctClus: A Fast Clustering Algorithm for Heterogeneous Information Networks

qPMS7: A Fast Algorithm for Finding (ℓ, d)-Motifs in DNA and Protein Sequences