skip to main content
10.1145/3071178.3071239acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

CycloAnt: sequencing cyclic peptides using hybrid ants

Published: 01 July 2017 Publication History

Abstract

Non ribosomal cyclic peptides have long been used as effective antibiotics in drug industry. Reconstruction of these peptide sequences extracted from natural elements remain a challenge till today. Introduction of mass spectrometry in this regard created scope for computer scientists to develop efficient algorithms to interpret a mass spectrum into a peptide sequence. Mass spectrum have a well known limitation of missing peaks which misleads the de novo sequencing process of cyclic peptides. In this paper, we present CycloAnt, a computational method that can reproduce correct cyclic amino acid sequence from distorted mass spectrum in an efficient way. We have used hybrid ants those construct the solution first and then try to improve quality of the solution using subsequent local search. We proposed a set of novel scoring functions which emphasize on the presence of sub-sequences of amino acids rather than approving equal contribution of all partial mass and precursor mass present in the spectrum. Moreover, we proposed a novel set of operators for the local search and refinement. Experiments show the effectiveness of our method on a standard set of benchmark and improvement over other methods.

References

[1]
Ruedi Aebersold and David R Goodlett. 2001. Mass spectrometry in proteomics. Chemical reviews 101, 2 (2001), 269--296.
[2]
Jens Allmer. 2011. Algorithms for the de novo sequencing of peptides from tandem mass spectra. Expert review of proteomics 8, 5 (2011), 645--657.
[3]
Nuno Bandeira, Julio Ng, Dario Meluzzi, Roger G Linington, Pieter Dorrestein, and Pavel A Pevzner. 2008. De novo sequencing of nonribosomal peptides. In Annual International Conference on Research in Computational Molecular Biology. Springer, 181--195.
[4]
Benjamin Barán and Matilde Schaerer. 2003. A Multiobjective Ant Colony System for Vehicle Routing Problem with Time Windows. In Applied informatics. 97--102.
[5]
Ségolène Caboche, Maude Pupin, Valérie Leclère, Arnaud Fontaine, Philippe Jacques, and Gregory Kucherov. 2008. NORINE: a database of nonribosomal peptides. Nucleic acids research 36, suppl 1 (2008), D326--D331.
[6]
Ting Chen, Ming-Yang Kao, Matthew Tepel, John Rush, and George M Church. 2001. A dynamic programming approach to de novo peptide sequencing via tandem mass spectrometry. Journal of Computational Biology 8, 3 (2001), 325--337.
[7]
Keng Wah Choo and Wai Mun Tham. 2007. Tandem mass spectrometry data quality assessment by self-convolution. BMC bioinformatics 8, 1 (2007), 1.
[8]
Mark Cieliebak, Stephan Eidenbenz, and Paolo Penna. 2003. Noisy data make the partial digest problem NP-hard. In International Workshop on Algorithms in Bioinformatics. Springer, 111--123.
[9]
Tamara Dakic. 2000. On the turnpike problem. Ph.D. Dissertation. Simon Fraser University.
[10]
Marco Dorigo, Mauro Birattari, Christian Blum, Maurice Clerc, Thomas Stützle, and Alan Winfield. 2008. Ant Colony Optimization and Swarm Intelligence: 6th International Conference, ANTS 2008, Brussels, Belgium, September 22--24, 2008, Proceedings. Vol. 5217. Springer.
[11]
René J Dubos. 1939. Studies on a bactericidal agent extracted from a soil bacillus: I. Preparation of the agent. Its activity in vitro. The Journal of experimental medicine 70, 1 (1939), 1.
[12]
Bernd Fischer, Volker Roth, Franz Roos, Jonas Grossmann, Sacha Baginsky, Peter Widmayer, Wilhelm Gruissem, and Joachim M Buhmann. 2005. NovoHMM: a hidden Markov model for de novo peptide sequencing. Analytical chemistry 77, 22 (2005), 7265--7273.
[13]
Eduard Fomin. 2015. Reconstruction of sequence from its circular partial sums for cyclopeptide sequencing problem. Journal of bioinformatics and computational biology 13, 01 (2015), 1540008.
[14]
Ari Frank and Pavel Pevzner. 2005. PepNovo: de novo peptide sequencing via probabilistic network modeling. Analytical chemistry 77, 4 (2005), 964--973.
[15]
Muztaba Hasanat, Mehadi Hasan, Istiak Ahmed, Mehedi Iqbal Chowdhury, Jannatul Ferdous, and Swakkhar Shatabda. 2016. An ant colony optimization algorithm for load shedding minimization in smart grids. In Informatics, Electronics and Vision (ICIEV), 2016 5th International Conference on. IEEE, 176--181.
[16]
Jan A Hiss, Michael Reutlinger, Christian P Koch, Anna M Perna, Petra Schneider, Tiago Rodrigues, Sarah Haller, Gerd Folkers, Lutz Weber, Renato B Baleeiro, and others. 2014. Combinatorial chemistry by ant colony optimization. Future medicinal chemistry 6, 3 (2014), 267--280.
[17]
Guohui Lin, Dong Xu, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen, and Ying Xu. 2002. An efficient branch-and-bound algorithm for the assignment of protein backbone NMR peaks. In Bioinformatics Conference, 2002. Proceedings. IEEE Computer Society. IEEE, 165--174.
[18]
Bin Ma. 2010. Challenges in computational analysis of mass spectrometry data for proteomics. Journal of Computer Science and Technology 25,1 (2010), 107--123.
[19]
Bin Ma, Kaizhong Zhang, and Chengzhi Liang. 2005. An effective algorithm for peptide de novo sequencing from MS/MS spectra. J. Comput. System Sci. 70, 3 (2005), 418--430.
[20]
Mario Alberto Martínez-Núñez and Víctor Eric López y López. 2016. Nonribosomal peptides synthetases and their applications in industry. Sustainable Chemical Processes 4, 1 (2016), 13.
[21]
Hosein Mohimani, Wei-Ting Liu, Yu-Liang Yang, Susana P Gauděncio, William Fenical, Pieter C Dorrestein, and Pavel A Pevzner. 2011. Multiplex de novo sequencing of peptide antibiotics. Journal of Computational Biology 18, 11 (2011), 1371--1381.
[22]
Hosein Mohimani, Yu-Liang Yang, Wei-Ting Liu, Pei-Wen Hsieh, Pieter C Dorrestein, and Pavel A Pevzner. 2011. Sequencing cyclic peptides by multistage mass spectrometry. Proteomics 11, 18 (2011), 3642--3650.
[23]
Julio Ng, Nuno Bandeira, Wei-Ting Liu, Majid Ghassemian, Thomas L Simmons, William Gerwick, Roger Linington, Pieter Dorrestein, and Pavel Pevzner. 2009. Dereplication and de novo sequencing of nonribosomal peptides. Nature methods 6, 8 (2009), 596.
[24]
Jiří Novák, Karel Lemr, Kevin A Schug, and Vladimír Havlíček. 2015. CycloBranch: de novo sequencing of nonribosomal peptides from accurate product ion mass spectra. Journal of The American Society for Mass Spectrometry 26, 10 (2015), 1780--1786.
[25]
Pavel A Pevzner, Vlado Dančík, and Chris L Tang. 2000. Mutation-tolerant protein identification by mass spectrometry. Journal of Computational Biology 7, 6 (2000), 777--787.
[26]
Alena Shmygelska and Holger H Hoos. 2005. An ant colony optimisation algorithm for the 2D and 3D hydrophobic polar protein folding problem. BMC bioinformatics 6, 1 (2005), 30.
[27]
Steven S Skiena, Warren D Smith, and Paul Lemke. 1990. Reconstructing sets from interpoint distances. In Proceedings of the sixth annual symposium on Computational geometry. ACM, 332--339.
[28]
Steven S Skiena and Gopalakrishnan Sundaram. 1994. A partial digest approach to restriction site mapping. Bulletin of Mathematical Biology 56, 2 (1994), 275--294.
[29]
Hanno Steen and Matthias Mann. 2004. The ABC's (and XYZ's) of peptide sequencing. Nature reviews Molecular cell biology 5, 9 (2004), 699--711.
[30]
Marc Oliver Wagner, Bernard Yannou, Steffen Kehl, Dominique Feillet, and Jan Eggers. 2003. Ergonomic modelling and optimization of the keyboard arrangement with an ant colony algorithm. Journal of Engineering Design 14, 2 (2003), 187--208.
[31]
Changjiang Xu and Bin Ma. 2006. Complexity and scoring function of MS/MS peptide de novo sequencing. In Comput. Syst. Bioinformatics Conf, Vol. 5, 361--369.

Cited By

View all

Index Terms

  1. CycloAnt: sequencing cyclic peptides using hybrid ants

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    GECCO '17: Proceedings of the Genetic and Evolutionary Computation Conference
    July 2017
    1427 pages
    ISBN:9781450349208
    DOI:10.1145/3071178
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 July 2017

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. heuristic
    2. hybrid ants
    3. local search
    4. operators

    Qualifiers

    • Research-article

    Conference

    GECCO '17
    Sponsor:

    Acceptance Rates

    GECCO '17 Paper Acceptance Rate 178 of 462 submissions, 39%;
    Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)6
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 10 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media