Fundamental Study Parallel constructions of maximal path sets and applications to short superstrings

Theoretical Computer Science

Volumn 161, Issue 1-2, 1996, Pages 1-21

  Chen, Zhi Zhong ^a  

^a TOKYO DENKI UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347419733     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00110-7     Document Type: Article

References (18)

1. C. Armen and C. Stein, A 23/4-approximation algorithm for the shortest superstring problem, unpublished manuscript, 1994.
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, New York, 1991) 328-336.
3. R. Cole, Parallel merge sort, SIAM J. Comput. 17 (1988) 770-785.
4. 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.
5. J. Gallant, D. Maier and J. Storer, On finding minimal length superstrings, J. Comput. System Sci. 20 (1980) 50-58.
6. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
7. A. Israeli and A. Itai, A fast and simple randomized parallel algorithm for maximal matching, Inform. Process. Lett. 22 (1986) 77-80.
8. A. Israeli and Y. Shiloach, An improved maximal matching parallel algorithm, Inform. Process. Lett. 22 (1986) 57-60.
9. 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, New York, 1982) 312-320.
10. R.M. Karp and V. Ramachandran, Parallel Algorithms for Shared Memory Machines, in: J. van Leeuwen ed., Handbook of Theoretical Computer Science Vol. A (Elsevier, Amsterdam, 1990) 868-941.
11. M. Li, Towards a DNA sequencing theory (learning a string), in: Proc. 31st IEEE Symp. on Foundations of Computer Science (IEEE, New York, 1990) 125-134.
12. K. Mulmuley, U.V. Vazirani and V.V. Vazirani, Matching is as easy as matrix inversion, in: Proc. 19th ACM Symp. on Theory of Computing (ACM, New York, 1987) 345-354.
13. 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.
14. 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, New York, 1994) 166-177.
15. J. Storer, Data Compression: Methods and Theory (Computer Science Press, Rockville, MD, 1988).
16. J. Tarhio and E. Ukkonen, A greedy approximation algorithm for constructing shortest common superstrings, Theoret. Comput. Sci. 57 (1988) 131-145.
17. S.-H. Teng and F. Yao, Approximating shortest superstrings, in: Proc. 34th IEEE Symp. on Foundations of Computer Science (IEEE, New York, 1993) 158-165.
18. J.-S. Turner, Approximation algorithms for the shortest common superstring problem, Inform. and Comput. 83 (1989) 1-20.