Performance and analysis of modified voting algorithm for planted motif search

Mostafa Abbas, Hazem M. Bahig

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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 {s 1, 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.

Original languageEnglish
Title of host publication2009 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2009
Pages725-731
Number of pages7
DOIs
Publication statusPublished - 19 Oct 2009
Externally publishedYes
Event7th IEEE/ACS International Conference on Computer Systems and Applications, AICCSA-2009 - Rabat, Morocco
Duration: 10 May 200913 May 2009

Other

Other7th IEEE/ACS International Conference on Computer Systems and Applications, AICCSA-2009
CountryMorocco
CityRabat
Period10/5/0913/5/09

Fingerprint

Hamming distance

Keywords

  • Bioinformatics
  • Exact algorithms
  • Planted motif search problem
  • Voting technique

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Abbas, M., & Bahig, H. M. (2009). Performance and analysis of modified voting algorithm for planted motif search. In 2009 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2009 (pp. 725-731). [5069407] https://doi.org/10.1109/AICCSA.2009.5069407

Performance and analysis of modified voting algorithm for planted motif search. / Abbas, Mostafa; Bahig, Hazem M.

2009 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2009. 2009. p. 725-731 5069407.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abbas, M & Bahig, HM 2009, Performance and analysis of modified voting algorithm for planted motif search. in 2009 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2009., 5069407, pp. 725-731, 7th IEEE/ACS International Conference on Computer Systems and Applications, AICCSA-2009, Rabat, Morocco, 10/5/09. https://doi.org/10.1109/AICCSA.2009.5069407
Abbas M, Bahig HM. Performance and analysis of modified voting algorithm for planted motif search. In 2009 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2009. 2009. p. 725-731. 5069407 https://doi.org/10.1109/AICCSA.2009.5069407
Abbas, Mostafa ; Bahig, Hazem M. / Performance and analysis of modified voting algorithm for planted motif search. 2009 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2009. 2009. pp. 725-731
@inproceedings{f8beec78088443389cb0fe320b292876,
title = "Performance and analysis of modified voting algorithm for planted motif search",
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 {s 1, 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.",
keywords = "Bioinformatics, Exact algorithms, Planted motif search problem, Voting technique",
author = "Mostafa Abbas and Bahig, {Hazem M.}",
year = "2009",
month = "10",
day = "19",
doi = "10.1109/AICCSA.2009.5069407",
language = "English",
isbn = "9781424438068",
pages = "725--731",
booktitle = "2009 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2009",

}

TY - GEN

T1 - Performance and analysis of modified voting algorithm for planted motif search

AU - Abbas, Mostafa

AU - Bahig, Hazem M.

PY - 2009/10/19

Y1 - 2009/10/19

N2 - 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 {s 1, 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.

AB - 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 {s 1, 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.

KW - Bioinformatics

KW - Exact algorithms

KW - Planted motif search problem

KW - Voting technique

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

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

U2 - 10.1109/AICCSA.2009.5069407

DO - 10.1109/AICCSA.2009.5069407

M3 - Conference contribution

SN - 9781424438068

SP - 725

EP - 731

BT - 2009 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2009

ER -