IDEAS home Printed from https://ideas.repec.org/a/spr/stmapp/v26y2017i2d10.1007_s10260-016-0370-y.html
   My bibliography  Save this article

Discriminating membrane proteins using the joint distribution of length sums of success and failure runs

Author

Listed:
  • Sotirios Bersimis

    (University of Piraeus)

  • Athanasios Sachlas

    (University of Piraeus)

  • Pantelis G. Bagos

    (University of Thessaly)

Abstract

Discriminating integral membrane proteins from water-soluble ones, has been over the past decades an important goal for computational molecular biology. A major drawback of methods appeared in the literature, is that most of the authors tried to solve the problem using machine learning techniques. Specifically, most of the proposed methods require an appropriate dataset for training, and consequently the results depend heavily on the suitability of the dataset, itself. Motivated by these facts, in this paper we develop a formal discrimination procedure that is based on appropriate theoretical observations on the sequence of hydrophobic and polar residues along the protein sequence and on the exact distribution of a two dimensional runs-related statistic defined on the same sequence. Specifically, for setting up our discrimination procedure, we study thoroughly the exact distribution of a bivariate random variable, which accumulates the exact lengths of both success and failure runs of at least a specific length in a sequence of Bernoulli trials. To investigate the properties of this bivariate random variable, we use the Markov chain embedding technique. Finally, we apply the new procedure to a well-defined dataset of proteins.

Suggested Citation

  • Sotirios Bersimis & Athanasios Sachlas & Pantelis G. Bagos, 2017. "Discriminating membrane proteins using the joint distribution of length sums of success and failure runs," Statistical Methods & Applications, Springer;Società Italiana di Statistica, vol. 26(2), pages 251-272, June.
    • Handle: RePEc:spr:stmapp:v:26:y:2017:i:2:d:10.1007_s10260-016-0370-y
    DOI: 10.1007/s10260-016-0370-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10260-016-0370-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10260-016-0370-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Wu, Tung-Lung & Glaz, Joseph, 2015. "A new adaptive procedure for multiple window scan statistics," Computational Statistics & Data Analysis, Elsevier, vol. 82(C), pages 164-172.
    2. D. Antzoulakos & S. Bersimis & M. Koutras, 2003. "On the distribution of the total number of run lengths," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 55(4), pages 865-884, December.
    3. M. Koutras & S. Bersimis & D. Antzoulakos, 2008. "Bivariate Markov chain embeddable variables of polynomial type," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 60(1), pages 173-191, March.
    4. Lou, W. Y. Wendy, 2003. "The exact distribution of the k-tuple statistic for sequence homology," Statistics & Probability Letters, Elsevier, vol. 61(1), pages 51-59, January.
    5. M. Koutras & V. Alexandrou, 1995. "Runs, scans and URN model distributions: A unified Markov chain approach," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 47(4), pages 743-766, December.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Frosso Makri & Zaharias Psillakis, 2011. "On runs of length exceeding a threshold: normal approximation," Statistical Papers, Springer, vol. 52(3), pages 531-551, August.
    2. Spiros D. Dafnis & Frosso S. Makri & Markos V. Koutras, 2021. "Generalizations of Runs and Patterns Distributions for Sequences of Binary Trials," Methodology and Computing in Applied Probability, Springer, vol. 23(1), pages 165-185, March.
    3. Anastasios N. Arapis & Frosso S. Makri & Zaharias M. Psillakis, 2017. "Joint distribution of k-tuple statistics in zero-one sequences of Markov-dependent trials," Journal of Statistical Distributions and Applications, Springer, vol. 4(1), pages 1-13, December.
    4. Spiros D. Dafnis & Frosso S. Makri, 2023. "Distributions Related to Weak Runs With a Minimum and a Maximum Number of Successes: A Unified Approach," Methodology and Computing in Applied Probability, Springer, vol. 25(1), pages 1-24, March.
    5. Spiros D. Dafnis & Frosso S. Makri, 2022. "Weak runs in sequences of binary trials," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 85(5), pages 573-603, July.
    6. M. Koutras & S. Bersimis & D. Antzoulakos, 2008. "Bivariate Markov chain embeddable variables of polynomial type," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 60(1), pages 173-191, March.
    7. Spiros Dafnis & Andreas Philippou & Demetrios Antzoulakos, 2012. "Distributions of patterns of two successes separated by a string of k-2 failures," Statistical Papers, Springer, vol. 53(2), pages 323-344, May.
    8. Dafnis, Spiros D. & Makri, Frosso S. & Philippou, Andreas N., 2019. "The reliability of a generalized consecutive system," Applied Mathematics and Computation, Elsevier, vol. 359(C), pages 186-193.
    9. Boutsikas V. Michael & Vaggelatou Eutichia, 2020. "On the Distribution of the Number of Success Runs in a Continuous Time Markov Chain," Methodology and Computing in Applied Probability, Springer, vol. 22(3), pages 969-993, September.
    10. Serkan Eryilmaz, 2005. "On the distribution and expectation of success runs in nonhomogeneous Markov dependent trials," Statistical Papers, Springer, vol. 46(1), pages 117-128, January.
    11. Markos V. Koutras & Demetrios P. Lyberopoulos, 2018. "Asymptotic results for jump probabilities associated to the multiple scan statistic," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 70(5), pages 951-968, October.
    12. Lou, W. Y. Wendy, 2003. "The exact distribution of the k-tuple statistic for sequence homology," Statistics & Probability Letters, Elsevier, vol. 61(1), pages 51-59, January.
    13. Sigeo Aki & Katuomi Hirano, 2002. "On Waiting Time for Reversed Patterns in Random Sequences," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 54(4), pages 713-718, December.
    14. Sáenz-de-Cabezón, Eduardo & Wynn, Henry P., 2011. "Computational algebraic algorithms for the reliability of generalized k-out-of-n and related systems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 82(1), pages 68-78.
    15. Stathis Chadjiconstantinidis & Serkan Eryilmaz, 2023. "Computing waiting time probabilities related to $$ (k_{1},k_{2},\ldots ,k_{l})$$ ( k 1 , k 2 , … , k l ) pattern," Statistical Papers, Springer, vol. 64(5), pages 1373-1390, October.
    16. Shinde, R.L. & Kotwal, K.S., 2006. "On the joint distribution of runs in the sequence of Markov-dependent multi-state trials," Statistics & Probability Letters, Elsevier, vol. 76(10), pages 1065-1074, May.
    17. Kiyoshi Inoue & Sigeo Aki, 2013. "Distributions of numbers of runs and scans on directed acyclic graphs with generation," Computational Statistics, Springer, vol. 28(3), pages 1133-1150, June.
    18. Sigeo Aki, 1999. "Distributions of Runs and Consecutive Systems on Directed Trees," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 51(1), pages 1-15, March.
    19. Serkan Eryilmaz, 2018. "Stochastic Ordering Among Success Runs Statistics in a Sequence of Exchangeable Binary Trials," Methodology and Computing in Applied Probability, Springer, vol. 20(2), pages 563-573, June.
    20. Yong Kong, 2019. "Decoupling Combinatorial Complexity: a Two-Step Approach to Distributions of Runs," Methodology and Computing in Applied Probability, Springer, vol. 21(3), pages 789-803, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:stmapp:v:26:y:2017:i:2:d:10.1007_s10260-016-0370-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.