NDLI: Performance and analysis of modified voting algorithm for planted motif search

Content Provider	IEEE Xplore Digital Library
Author	Abbas, M.M. Bahig, H.M.
Copyright Year	2009
Description	Author affiliation: Computer Science Division, Department of Mathematics, Faculty of Science, Ain Shams University, Cairo, Egypt (Bahig, H.M.) \|\| Department of Basic Science, Faculty of Engineering, Sinai University, Egypt (Abbas, M.M.)
Abstract	We consider the planted (l, d) motif search problem, which consists of finding a substring of length l that occurs in a set of input sequences {s1, s2, …, sn} with maximum Hamming distance, d, around the similar substring. In this paper, we present an experimental comparison between voting algorithm and its modification for planted motif on simulated data from (9, d) to (15, d) in case of challenging instances. The experimental results show that the modified voting algorithm is not better than voting algorithm as theoretically suggested. The results show that the running of voting algorithm is faster than modified voting algorithm in all the cases studied. We also determine, experimentally, the number of sequences that are required to make the modified voting algorithm faster than voting algorithm.
Starting Page	725
Ending Page	731
File Size	491901
Page Count	7
File Format	PDF
ISBN	9781424438075
DOI	10.1109/AICCSA.2009.5069407
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-05-10
Publisher Place	Morocco
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Performance analysis Algorithm design and analysis Voting bioinformatics Planted motif search problem voting technique exact algorithms
Content Type	Text
Resource Type	Article

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

Poster: Randomized algorithms for planted Motif Search

Fast and Practical Algorithms for Planted (l, d) Motif Search

StemFinder: An efficient algorithm for searching motif stems over large alphabets

Improved Exact Enumerative Algorithms for the Planted ($l$, $d$)-Motif Search Problem

Improved exact enumerative algorithms for the planted (l, d)-motif search problem

Space and Time Efficient Algorithms for Planted Motif Search (2006)

High-performance exact algorithms for motif search (2005).

Exact algorithms for planted motif problems (2005)

Fast and Practical Algorithms for Planted (l, d) Motif Search

Performance and analysis of modified voting algorithm for planted motif search

Similar Documents

Poster: Randomized algorithms for planted Motif Search

Fast and Practical Algorithms for Planted (l, d) Motif Search

StemFinder: An efficient algorithm for searching motif stems over large alphabets

Improved Exact Enumerative Algorithms for the Planted ($l$, $d$)-Motif Search Problem

Improved exact enumerative algorithms for the planted (l, d)-motif search problem

Space and Time Efficient Algorithms for Planted Motif Search (2006)

High-performance exact algorithms for motif search (2005).

Exact algorithms for planted motif problems (2005)

Fast and Practical Algorithms for Planted (l, d) Motif Search

Performance and analysis of modified voting algorithm for planted motif search