Skip to main content
SpringerLink
Log in

NC algorithms for finding a maximal set of paths with application to compressing strings

  • Algorithms I
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 944))

Included in the following conference series:

  • 153 Accesses

Abstract

It is shown that the problem of finding a maximal set of paths in a given (undirected or directed) graph is in NC. This result is then used to obtain three parallel approximation algorithms for the shortest superstring problem. The first is an NC algorithm achieving a compression ratio of 1/3+ε for any ε > 0. The second is an RNC algorithm achieving a compression ratio of 38/63 ≈ 0.603. The third is an RNC algorithm achieving an approximation ratio of 2 50/63 ≈ 2.793. All the results significantly improve on the best previous ones.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Armen and C. Stein, A 2 3/4-Approximation Algorithm for the Shortest Superstring Problem, unpublished manuscript, 1994.

    Google Scholar 

  2. A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis, Linear Approximation of Shortest Superstrings, in: Proc. 23rd ACM Symp. on Theory of Computing (ACM, 1991) 328–336.

    Google Scholar 

  3. A. Czumaj, L. Gasieniec, M. Piotrow, and W. Rytter, Parallel and Sequential Approximation of Shortest Superstrings, in: Proc. 4th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 824 (Springer, Berlin, 1994) 95–106.

    Google Scholar 

  4. J. Gallant, D. Maier, and J. Storer, On Finding Minimal Length Superstrings, Journal of Computer and System Sciences 20 (1980) 50–58.

    Google Scholar 

  5. N. Karmarkar and R.M. Karp, An Efficient Approximation Scheme for the One-Dimensional Bin Packing Problem, in: Proc. 23rd IEEE Symp. on Foundations of Computer Science (IEEE, 1982) 312–320.

    Google Scholar 

  6. M. Li, Towards a DNA Sequencing Theory (Learning a String), in: Proc. 31st IEEE Symp. on Foundations of Computer Science (IEEE, 1990) 125–134.

    Google Scholar 

  7. H. Peltola, H. Soderlund, J. Tarhio, and E. Ukkonen, Algorithms for Some String Matching Problems Arising in Molecular Genetics, in: Proc. 2nd IFIP Congress (1983) 53–64.

    Google Scholar 

  8. S. Rao Kosaraju, J.K. Park, and C. Stein, Long Tours and Short Superstrings, in: Proc. 35th IEEE Symp. on Foundations of Computer Science (IEEE, 1994) 166–177.

    Google Scholar 

  9. J. Storer, Data Compression: Methods and Theory (Computer Science Press, 1988).

    Google Scholar 

  10. J. Tarhio and E. Ukkonen, A Greedy Approximation Algorithm for Constructing Shortest Common Superstrings, Theoretical Computer Science 57 (1988) 131–145.

    Google Scholar 

  11. S.-H. Teng and F. Yao, Approximating Shortest Superstrings, in: Proc. 34th IEEE Symp. on Foundations of Computer Science (IEEE, 1993) 158–165.

    Google Scholar 

  12. J.-S. Turner, Approximation Algorithms for the Shortest Common Superstring Problem, Information and Computation 83 (1989) 1–20.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, 350-03, Saitama, Japan

    Zhi-Zhong Chen

Authors
  1. Zhi-Zhong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Fülöp Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, ZZ. (1995). NC algorithms for finding a maximal set of paths with application to compressing strings. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_66

Download citation

  • DOI: https://doi.org/10.1007/3-540-60084-1_66

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60084-8

  • Online ISBN: 978-3-540-49425-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation