Skip to main content
SpringerLink
Log in

Parallel Chaining Algorithms

  • Conference paper
Recent Advances in the Message Passing Interface (EuroMPI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6305))

Included in the following conference series:

  • 1020 Accesses

Abstract

Given a set of weighted hyper-rectangles in a k-dimensional space, the chaining problem is to identify a set of colinear and non-overlapping hyper-rectangles of total maximal weight. This problem is used in a number of applications in bioinformatics, string processing, and VLSI design. In this paper, we present parallel versions of the chaining algorithm for bioinformatics applications, running on multi-core and computer cluster architectures. Furthermore, we present experimental results of our implementations on both architectures.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abouelhoda, M.I., Ohlebusch, E.: Chaining algorithms and applications in comparative genomics. J. Discrete Algorithms 3(2-4), 321–341 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baker, B., Giancarlo, R.: Longest common subsequence from fragments via sparse dynamic programming. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 79–90. Springer, Heidelberg (1998)

    Google Scholar 

  3. Bently, J.L.: K-d trees for semidynamic point sets. In: Proc. of 6th Annual ACM Symposium on Computational Geometry, pp. 187–197 (1990)

    Google Scholar 

  4. Deogen, J.S., Yang, J., Ma, F.: EMAGEN: An efficient approach to multiple genome alignment. In: Proc. of Asia-Pacific Bioinf. Conf., pp. 113–122 (2004)

    Google Scholar 

  5. Eppstein, D., Galil, Z., Giancarlo, R., Italiano, G.F.: Sparse dynamic programming. J. Assoc. Comput. Mach. 39, 519–567 (1992)

    MATH  MathSciNet  Google Scholar 

  6. Felsner, S., Müller, R., Wernisch, L.: Trapezoid graphs and generalizations, geometry and algorithms. Discrete Applied Mathematics 74(1), 13–32 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Höhl, M., Kurtz, S., Ohlebusch, E.: Efficient multiple genome alignment. Bioinformatics 18(Suppl. 1), 312–320 (2002)

    Google Scholar 

  8. Myers, E.W., Huang, X.: An O(n 2logn) restriction map comparison and search algorithm. Bulletin of Mathematical Biology 54(4), 599–618 (1992)

    MATH  Google Scholar 

  9. Myers, E.W., Miller, W.: Chaining multiple-alignment fragments in sub-quadratic time. In: Proc. of SODA, pp. 38–47 (1995)

    Google Scholar 

  10. Shibuya, S., Kurochkin, I.: Match chaining algorithms for cDNA mapping. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol. 2812, pp. 462–475. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Treangen, T., Messeguer, X.: M-GCAT: Interactively and efficiently constructing large-scale multiple genome comparison frameworks. BMC Bioinformatics 7, 433 (2006)

    Article  Google Scholar 

  12. Zhang, Z., Raghavachari, B., Hardison, R.C., et al.: Chaining multiple-alignment blocks. J. Computional Biology 1, 51–64 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for informatics sciences, Nile University, Smart Village, Giza, Egypt

    Mohamed Abouelhoda & Hisham Mohamed

Authors
  1. Mohamed Abouelhoda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hisham Mohamed
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. High Performance Computing Center Stuttgart (HLRS), Universität Stuttgart, Nobelstr. 19, 70569, Stuttgart, Germany

    Rainer Keller

  2. Parallel Software Technologies Laboratory, Department of Computer Science, University of Houston,  

    Edgar Gabriel

  3. High Performance Computing Center Stuttgart, University of Stuttgart, Nobelstr. 19, 70569, Stuttgart, Germany

    Michael Resch

  4. Department of Electrical Engineering and Computer Science, University of Tennessee, 37996-3450, Knoxville, TN, USA

    Jack Dongarra

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abouelhoda, M., Mohamed, H. (2010). Parallel Chaining Algorithms. In: Keller, R., Gabriel, E., Resch, M., Dongarra, J. (eds) Recent Advances in the Message Passing Interface. EuroMPI 2010. Lecture Notes in Computer Science, vol 6305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15646-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15646-5_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15645-8

  • Online ISBN: 978-3-642-15646-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation