Table of Contents Author Guidelines Submit a Manuscript
Computational and Mathematical Methods in Medicine
Volume 2016 (2016), Article ID 5010316, 5 pages
http://dx.doi.org/10.1155/2016/5010316
Research Article

Compatibility and Conjugacy on Partial Arrays

1Department of Science and Humanity, Sathyabama University, Chennai, India
2Department of Mathematics, St. Joseph’s College of Engineering, Chennai, India

Received 27 March 2016; Revised 28 July 2016; Accepted 3 August 2016

Academic Editor: Qi Dai

Copyright © 2016 S. Vijayachitra and K. Sasikala. 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. D. G. Arquès and Ch. J. Michel, “A possible code in the genetic code,” in STACS 95, vol. 900 of Lecture Notes in Computer Science, pp. 640–651, Springer, Berlin, Germany, 1995. View at Publisher · View at Google Scholar
  2. F. Blanchet-Sadri and R. A. Hegstrom, “Partial words and a theorem of Fine and Wilf revisited,” Theoretical Computer Science, vol. 270, no. 1-2, pp. 401–419, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  3. A. Colosimo and A. de Luca, “Special factors in biological strings,” Journal of Theoretical Biology, vol. 204, no. 1, pp. 29–46, 2000. View at Publisher · View at Google Scholar · View at Scopus
  4. F. Blanchet-Sadri, D. Dakota Blair, and R. V. Lewis, “Equations on partial words,” RAIRO—Theoretical Informatics and Applications, vol. 43, pp. 23–29, 2009. View at Google Scholar
  5. F. Sweety, D. G. Thomas, and T. Kalyani, “Collage of hexagonal arrays,” in Advances in Visual Computing, G. Bebis, R. Boyle, B. Parvin et al., Eds., vol. 5359 of Lecture Notes in Computer Science, pp. 1167–1175, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar
  6. F. Blanchet-Sadri and D. K. Luhmann, “Conjugacy on partial words,” Theoretical Computer Science, vol. 289, no. 1, pp. 297–312, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. J. Berstel and L. Boasson, “Partial words and a theorem of Fine and Wilf,” Theoretical Computer Science, vol. 218, no. 1, pp. 135–141, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  8. A. de Luca, “On the combinatorics of finite words,” Theoretical Computer Science, vol. 218, no. 1, pp. 13–39, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  9. C. Choffrut and J. Karthumaki, “Combinatorics of words,” in Handbook of Formal Languages, G. Rozenberg and A. Salomaa, Eds., vol. 1, chapter 6, pp. 329–438, Springer, Berlin, Germany, 1999. View at Google Scholar
  10. M. Lothaire, Combinatorics on Words, Cambridge Mathematical Library, Cambridge University Press, Cambridge, UK, 1997. View at Publisher · View at Google Scholar · View at MathSciNet
  11. F. Sweety, D. G. Thomas, and V. R. Dare, “Subarray complexity of partial arrays,” in Intelligent Optimization Modeling, pp. 85–94, Allied, 2006. View at Google Scholar