Table of Contents Author Guidelines Submit a Manuscript
BioMed Research International
Volume 2014, Article ID 745298, 11 pages
http://dx.doi.org/10.1155/2014/745298
Research Article

Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem

1KINDI Lab for Computing Research, Qatar University P.O. Box 2713, Doha, Qatar
2Faculty of Engineering, Cairo University, Giza, Egypt
3Center for Informatics Sciences, Nile University, Giza, Egypt

Received 16 January 2014; Accepted 10 March 2014; Published 16 April 2014

Academic Editor: Ryuji Hamamoto

Copyright © 2014 Maan Haj Rachid 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.

Citations to this Article [4 citations]

The following is the list of published articles that have cited the current article.

  • Maan Haj Rachid, and Qutaibah Malluhi, “A Practical and Scalable Tool to Find Overlaps between Sequences,” BioMed Research International, vol. 2015, pp. 1–12, 2015. View at Publisher · View at Google Scholar
  • William H.A. Tustumi, Simon Gog, Guilherme P. Telles, and Felipe A. Louza, “An improved algorithm for the all-pairs suffix-prefix problem,” Journal of Discrete Algorithms, 2016. View at Publisher · View at Google Scholar
  • Jihyuk Lim, and Kunsoo Park, “A fast algorithm for the all-pairs suffix–prefix problem,” Theoretical Computer Science, vol. 698, pp. 14–24, 2017. View at Publisher · View at Google Scholar
  • Maan Haj Rachid, “Two Efficient Techniques to Find Approximate Overlaps between Sequences,” BioMed Research International, vol. 2017, pp. 1–8, 2017. View at Publisher · View at Google Scholar