Advertisement

An Efficient Sequence Alignment Algorithm on a LARPBS

  • David Semé
  • Sidney Youlou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4707)

Abstract

In this paper, we give a parallel algorithm solving the sequence alignment problem on a LARPBS, one of the recently proposed parallel model based on optical bus. The complexity of our algorithm solving the sequence alignment problem is O(m) using n processors (where m and n are respectively the sizes of the shortest and the longest sequences).

Keywords

Parallel Algorithm Edit Distance Levenshtein Distance Conditional Delay Sequence Alignment Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chen, L., Juan, C., Pan, Y.: Fast scable algorithm on LARPBS for sequence alignment. In: ISPA Workshops, pp. 176–185 (2005)Google Scholar
  2. 2.
    Gotoh, O.: An improved algorithm for matching biological sequences. Journal of Molecular Biology 162(3), 705–708 (1982)CrossRefGoogle Scholar
  3. 3.
    Guo, Z., Melhem, R., Hall, R., Chiarulli, D., Levitan, S.: Array processors with pipelined optical busses. Journal of Parallel and Distributed Computing 12(3), 269–282 (1991)CrossRefGoogle Scholar
  4. 4.
    Hoang, D.T., Lopresti, D.P.: FPGA implemenatation of systolic sequence alignment, pp. 183–191 (1992)Google Scholar
  5. 5.
    Lecroq, T., Myoupo, J.F., Semé, D.: A one-phase parallel algorithm for the sequence alignment problem. Parallel Processing Letters 8(4), 515–526 (1998)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Levenstein, V.I.: Binary codes capable of correcting spurious insertions and deletions of ones. problems of Information Transmission 1, 8–17 (1965)MathSciNetGoogle Scholar
  7. 7.
    Li, K., Pan, Y.: Linear array with a reconfigurable pipelined bus system: Concepts and applications. Information sciences An International Journal 11(7), 237–258 (1998)CrossRefGoogle Scholar
  8. 8.
    Lopes, H.S., Moritz, G.L.: A distributed approach for a multiple sequence alignment algorithm using a parallel virtual machine. In: Proceedings of the 27th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBS), Changai, China (2005)Google Scholar
  9. 9.
    Needleman, S.B., Wunsch, G.L.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48, 444–453 (1970)CrossRefGoogle Scholar
  10. 10.
    Semé, D., Youlou, S.: Computing the longest common subsequence on a linear array with reconfigurable pipelined bus system. In: PDCS, pp. 49–54 (2005)Google Scholar
  11. 11.
    Semé, D., Youlou, S.: Parallel algorithm for string matching problems on a linear array with reconfigurable pipelined bus system. In: PDCS, pp. 55–60 (2005)Google Scholar
  12. 12.
    Semé, D., Youlou, S.: Parallel solutions of the longest increasing subsequence problem using pipelined optical bus system. In: PDPTA, pp. 617–622 (2005)Google Scholar
  13. 13.
    Semé, D., Youlou, S.: Repetitons detection on a linear array with reconfigurable pipelined bus system. International Journal of Parallel, Emergent and Distributed Systems (2007) (to appear)Google Scholar
  14. 14.
    Smith, T.F., Waterman, M.S.: Identification of common molecular subsequent. Journal of molecular 147, 195–197 (1981)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • David Semé
    • 1
  • Sidney Youlou
    • 1
  1. 1.LaRIA : Laboratoire de Recherche en Informatique d’Amiens, Université de Picardie Jules Verne, CURI, 5 rue du Moulin Neuf, 80000 AmiensFrance

Personalised recommendations