Table of Contents Author Guidelines Submit a Manuscript
BioMed Research International
Volume 2014 (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.

Linked References

  1. D. Gusfield, G. M. Landau, and B. Schieber, “An efficient algorithm for the all pairs suffix-prefix problem,” Information Processing Letters, vol. 41, no. 4, pp. 181–185, 1992. View at Publisher · View at Google Scholar · View at Scopus
  2. S. Kurtz, “Reducing the space requirement of suffix trees,” Software: Practice and Experience, vol. 29, no. 13, pp. 1149–1171, 1999. View at Google Scholar · View at Scopus
  3. E. Ohlebusch and S. Gog, “Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem,” Information Processing Letters, vol. 110, no. 3, pp. 123–128, 2010. View at Publisher · View at Google Scholar · View at Scopus
  4. M. I. Abouelhoda, S. Kurtz, and E. Ohlebusch, “Replacing suffix trees with enhanced suffix arrays,” Journal of Discrete Algorithms, vol. 2, no. 1, pp. 53–86, 2004. View at Publisher · View at Google Scholar · View at Scopus
  5. J. T. Simpson and R. Durbin, “Efficient de novo assembly of large genomes using compressed data structures,” Genome Research, vol. 22, no. 3, pp. 549–556, 2012. View at Publisher · View at Google Scholar · View at Scopus
  6. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro, “An alphabet-friendly fm-index,” in String Processing and Information Retrieval, A. Apostolico and M. Melucci, Eds., vol. 3246 of Lecture Notes in Computer Science, pp. 150–160, 2004. View at Publisher · View at Google Scholar
  7. K. Sadakane, “Compressed suffix trees with full functionality,” Theory of Computing Systems, vol. 41, no. 4, pp. 589–607, 2007. View at Publisher · View at Google Scholar · View at Scopus
  8. P. Weiner, “Linear pattern matching algorithms,” in Proceedings of the 14th Annual Symposium on Switching and Automata Theory (SWAT '73), pp. 1–11, 1973. View at Publisher · View at Google Scholar
  9. E. Ukkonen, “On-line construction of suffix trees,” Algorithmica, vol. 14, no. 3, pp. 249–260, 1995. View at Publisher · View at Google Scholar · View at Scopus
  10. V. Mäkinen and G. Navarro, “Succinct suffix arrays based on run-length encoding,” Nordic Journal of Computing, vol. 12, no. 1, pp. 40–66, 2005. View at Google Scholar
  11. R. Grossi, A. Gupta, and J. S. Vitter, “High-order entropy-compressed text indexes,” in Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '03), pp. 841–850, November 1998. View at Scopus
  12. M. Burrows and D. J. Wheeler, “A block-sorting lossless data compression algorithm,” Tech. Rep., Digital SRC Research Report, 1994. View at Google Scholar
  13. J. I. Munro, V. Raman, and S. S. Rao, “Space efficient suffix trees,” Journal of Algorithms, vol. 39, no. 2, pp. 205–222, 2001. View at Publisher · View at Google Scholar · View at Scopus
  14. N. Välimäki, V. Mäkinen, W. Gerlach, and K. Dixit, “Engineering a compressed suffix tree implementation,” Journal of Experimental Algorithmics, vol. 14, article 2, 2009. View at Publisher · View at Google Scholar
  15. E. W. Myers, “The fragment assembly string graph,” Bioinformatics, vol. 21, supplement 2, pp. 79–85, 2005. View at Publisher · View at Google Scholar
  16. N. Välimäki, W. Gerlach, K. Dixit, and V. Mäkinen, “Compressed suffix tree—a basis for genome-scale sequence analysis,” Bioinformatics, vol. 23, no. 5, pp. 629–630, 2007. View at Publisher · View at Google Scholar
  17. S. Gog, Compressed Suffix Trees: Design, Construction, and Applications, 2011.