Table of Contents Author Guidelines Submit a Manuscript
BioMed Research International
Volume 2015 (2015), Article ID 936295, 13 pages
http://dx.doi.org/10.1155/2015/936295
Research Article

Application of Stochastic Automata Networks for Creation of Continuous Time Markov Chain Models of Voltage Gating of Gap Junction Channels

1Department of Mathematical Modelling, Kaunas University of Technology, Studentų Street 50, 51368 Kaunas, Lithuania
2Laboratory of Systems Control and Automation, Lithuanian Energy Institute, Breslaujos Street 3, 44403 Kaunas, Lithuania
3Department of Applied Informatics, Vytautas Magnus University, Vileikos Street 8-409, 44404 Kaunas, Lithuania
4Department of Business Informatics Research in Systems, Kaunas University of Technology, Studentų Street 56, 5142 Kaunas, Lithuania
5Department of Anesthesiology, Albert Einstein College of Medicine, 1300 Morris Park Avenue, Bronx, NY 10461, USA
6Department of Anesthesiology, New York Hospital Queens, 56-45 Main Street, Flushing, NY 11355, USA
7Institute of Cardiology, Lithuanian University of Health Sciences, Sukileliu Street 17, 50009 Kaunas, Lithuania
8Department of Neuroscience, Albert Einstein College of Medicine, 1300 Morris Park Avenue, Bronx, NY 10461, USA

Received 4 July 2014; Revised 7 December 2014; Accepted 8 December 2014

Academic Editor: Carlo Cattani

Copyright © 2015 Mindaugas Snipas et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. F. Ek-Vitorin, T. J. King, N. S. Heyman, P. D. Lampe, and J. M. Burt, “Selectivity of connexin 43 channels is regulated through protein kinase C-dependent phosphorylation,” Circulation Research, vol. 98, no. 12, pp. 1498–1505, 2006. View at Publisher · View at Google Scholar · View at Scopus
  2. G. Söhl and K. Willecke, “Gap junctions and the connexin protein family,” Cardiovascular Research, vol. 62, no. 2, pp. 228–232, 2004. View at Publisher · View at Google Scholar · View at Scopus
  3. G. E. Sosinsky and B. J. Nicholson, “Structural organization of gap junction channels,” Biochimica et Biophysica Acta (BBA)—Biomembranes, vol. 1711, no. 2, pp. 99–125, 2005. View at Publisher · View at Google Scholar · View at Scopus
  4. F. F. Bukauskas and V. K. Verselis, “Gap junction channel gating,” Biochimica et Biophysica Acta: Biomembranes, vol. 1662, no. 1-2, pp. 42–60, 2004. View at Publisher · View at Google Scholar · View at Scopus
  5. N. Paulauskas, H. Pranevicius, J. Mockus, and F. F. Bukauskas, “Stochastic 16-state model of voltage gating of gap-junction channels enclosing fast and slow gates,” Biophysical Journal, vol. 102, no. 11, pp. 2471–2480, 2012. View at Publisher · View at Google Scholar · View at Scopus
  6. N. Paulauskas, M. Pranevicius, H. Pranevicius, and F. F. Bukauskas, “A stochastic four-state model of contingent gating of gap junction channels containing two “fast” gates sensitive to transjunctional voltage,” Biophysical Journal, vol. 96, no. 10, pp. 3936–3948, 2009. View at Publisher · View at Google Scholar · View at Scopus
  7. A. Sakalauskaite, H. Pranevicius, M. Pranevicius, and F. Bukauskas, “Markovian model of the voltage gating of connexin-based gap junction channels,” Elektronika ir Elektrotechnika, no. 5, pp. 103–106, 2011. View at Google Scholar · View at Scopus
  8. H. Pranevicius, M. Pranevicius, O. Pranevicius, and et al, “Continuous time Markov chain models of voltage gating of gap junction channels,” Information Technology and Control, vol. 43, no. 2, pp. 133–142, 2014. View at Google Scholar
  9. W. J. Stewart, MARCA—Markov-Chain Analyzer: A Software Package for Markov Modeling, Marcel Dekker, New York, NY, USA, 1991.
  10. N. Yang, H. Yu, Z. Qian, and H. Sun, “Modeling and quantitatively predicting software security based on stochastic Petri nets,” Mathematical and Computer Modelling, vol. 55, no. 1-2, pp. 102–112, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. L. Brenner, P. Fernandes, B. Plateau et al., PEPS2007—Stochastic Automata Networks Software Tool, IEEE Computer Society, Los Alamitos, Calif, USA, 2007.
  12. P. Buchholz and T. Dayar, “Block SOR preconditioned projection methods for Kronecker structured Markovian representations,” SIAM Journal on Scientific Computing, vol. 26, no. 4, pp. 1289–1313, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. Y. Saad, “Iterative Methods for Sparse Linear Systems,” in Society for Industrial and Applied Mathematics, 2003. View at Google Scholar
  14. W. J. Stewart, Introduction to the Numerical Solution of Markov Chains, Princeton University Press, Princeton, NJ, USA, 1994. View at MathSciNet
  15. B. Plateau and K. Atif, “Stochastic automata network for modeling parallel systems,” IEEE Transactions on Software Engineering, vol. 17, no. 10, pp. 1093–1108, 1991. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. L. Mokdad and J. Ben-Othman, “Admission control mechanism and performance analysis based on stochastic automata networks formalism,” Journal of Parallel and Distributed Computing, vol. 71, no. 4, pp. 594–602, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. K. R. Braghetto, J. E. Ferreira, and J.-M. Vincent, “Performance evaluation of re source-aware business processes using stochastic automata networks,” International Journal of Innovative Computing, Information and Control, vol. 8, no. 7B, pp. 5295–5316, 2012. View at Google Scholar · View at Scopus
  18. H. DeRemigio, M. D. LaMar, P. Kemper, and G. D. Smith, “Markov chain models of coupled calcium channels: Kronecker representations and iterative solution methods,” Physical Biology, vol. 5, no. 3, Article ID 036003, 2008. View at Publisher · View at Google Scholar · View at Scopus
  19. Y. Hao, P. Kemper, and G. D. Smith, “Reduction of calcium release site models via fast/slow analysis and iterative aggregation/disaggregation,” Chaos, vol. 19, no. 3, Article ID 037107, 2009. View at Publisher · View at Google Scholar · View at Scopus
  20. V. Wolf, “Modelling of biochemical reactions by stochastic automata networks,” Electronic Notes in Theoretical Computer Science, vol. 171, no. 2, pp. 197–208, 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. A. N. Langville and W. J. Stewart, “The Kronecker product and stochastic automata networks,” Journal of Computational and Applied Mathematics, vol. 167, no. 2, pp. 429–447, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. A. Benoit, P. Fernandes, B. Plateau, and W. J. Stewart, “On the benefits of using functional transitions and Kronecker algebra,” Performance Evaluation, vol. 58, no. 4, pp. 367–390, 2004. View at Publisher · View at Google Scholar · View at Scopus
  23. A. Benoit, B. Plateau, and W. J. Stewart, “Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems,” Future Generation Computer Systems, vol. 22, no. 7, pp. 838–847, 2006. View at Publisher · View at Google Scholar · View at Scopus
  24. J. Thorson, Gaussian Elimination on a Banded Matrix, Stanford University, Stanford, Calif, USA, 1982.
  25. G. E. Cho and C. D. Meyer, “Comparison of perturbation bounds for the stationary distribution of a Markov chain,” Linear Algebra and Its Applications, vol. 335, no. 1–3, pp. 137–150, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus