GET THE APP

A deterministic algorithm for protein sequence detection | 35176
Journal of Proteomics & Bioinformatics

Journal of Proteomics & Bioinformatics
Open Access

ISSN: 0974-276X

A deterministic algorithm for protein sequence detection


2nd International Conference on Genetic & Protein Engineering

November 14-16, 2016 Atlanta, Georgia, USA

Abdellah Salhi

University of Essex, UK

Keynote: J Proteomics Bioinform

Abstract :

Sequence analysis is at the core of bioinformatics. Many algorithms have been developed for the purpose, which, almost invariably, try to measure the similarity between sequences of symbols drawn from  nite sets but with varied cardinalities.  ese algorithms are in two broad classes: deterministic and stochastic. Deterministic algorithms are o en hard to implement and are slow in practice. Stochastic algorithms, on the other hand, are relatively easier to implement and are e cient. However, they do not guarantee to  nd the correct solution when it exists.  is limits their use particularly where it is essential to know the exact solution as in medical situations.  e inherent uncertainty in the outcomes of deterministic approaches is exacerbated by the need to arbitrarily set a number of parameters on which they depend. Default values of these parameters are o en inappropriate outside the context in which they were estimated.  ere is, therefore, room for deterministic algorithms particularly when the time constraint is so . In this paper we highlight the limitations of stochastic algorithms on probably the most prominent genomics search tool, namely the Basic Local Search Tool or BLAST. We then present an algorithm which, besides being deterministic, is easy to understand and implement. We illustrate it on Shotgun Proteomics Data and compare it with a number of other well-known sequence comparison algorithms such as the Needleman-Wunch and Smith-Waterman algorithms.

Biography :

Abdellah Salhi is Professor of Operational Research. He obtained degree from University of Constantine, Algeria. He obtained his PhD in Interior-Point Methods from University of Aston in Birmingham, UK. His research interests are in the design, analysis, implementation and application of OR algorithms. Application areas include scheduling, decision making, data-mining and bioinformatics. He has led a number of research projects and contributes to the ESRC funded Business and Local Government Data Research Centre. He has published over 80 papers. He is currently the Head of the Department of Mathematical Science of Essex University, UK.

Email: as@essex.ac.uk

Top