Greedy algorithms for the shortest commonsuperstring that are asymtotically optimal

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1136, Issue , 1996, Pages 194-207

  Frieze, Alan ^a   Szpankowskit, Wojciech ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION; MOLECULAR BIOLOGY; OPTIMIZATION; STRING THEORY;

BASIC RESULTS; GREEDY ALGORITHMS; HIGH PROBABILITY; NP-HARD; PROBABILISTIC FRAMEWORK; SHORTEST COMMON SUPERSTRINGS;

ALGORITHMS;

EID: 84958049259     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61680-2_56     Document Type: Conference Paper

References (27)

1. [1] K. klexander, Shortest Common Superstring of Random Strings, Proc. Combinatorial Pattern Matching, Springer-Verlag, LNCS #807, 164-172, 1994
2. [2] C. Armen and C. Stein, Short Superstrings and the Structure of Overlapping Strings, Journal of Computational Biology, to appear.
3. [3] C. Armen and C. Stein, A 2-2/3 Approximation Algorithm for the Shortest Superstring Problem, Proc. Combinatorial Pattern Matching, 1996.
4. [4] W. Bains and G. Smith, A Novel Method for Nucleic Acid Sequence Determination, J. Theor. Biol., 135, 303-307, 1988.
5. [5] A. Blum, T. Jilong, M. Li, J. Tromp, M. Yannakakis, Linear Approximation of Shortest Superstring, J. the ACM, 41, 630-647, 1994; also STOCT 328-336, 1991.
6. [6] T.M. Cover and J.A. Thomas, Elements of Information Theory, John Wiley&:Sons, New York (1991).
7. [7] A. Czumaj, L. Gasienic, M. Piotrow and W. Rytter, Parallel and Sequential Approximations of Shortest Superstrings, Proceedings of the Fourth Scandinavian Workshop on Algorithm Theory, 95-106, 1994.
8. [8] R. Drmanac and C. Crkvenjakov, Sequencing by Hybridization (SBH) with Oligonucloide Probes as an Integral Approach for the Analysis of Complex Genome, Int. J. genomlc Research, 11 59-79, 1992.
9. [9] J. Gallantt, D. Maier and J.A. Storert On Finding Minimal Length Superstrings, Journal o] Computer and System Sciences, 20, 50-58, 1980.
10. [10] P. Jacquet and W. Szpankowski, Analysis of Digital Tries with Markovian Dependency, IEEE Trans. on InJormation Theory, 37, 1470-1475t 1991.
11. [11] T. Jiang and M. Li, Approximating Shortest Superstringwith Constraints, WADS, 385-396, Montreal 1993.
12. [12] T. Jiang, Z. Jiang and D. Breslauer, Rotation of Periodic Strings and Short Superstrings, Proceedings of the Third South American Conference on String Processing, to appear.
13. [13] D. E. Knuth, The Art of Computer Programming. Sorting and Searching, Addison- Wesley 1973.
14. [14] D. E. Knuth, Motwani and B. Pittel, Stable Husbands, Random Structures and Algorithms, 1, 1-14, 1990.
15. [15] S.R. Kosaraju, J.K. Park and C. Stein, Long Tours and Short Superstrings, Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 166-177, 1994.
16. [16] A. Lesek (Ed.), Computational Molecular Biology, Sources and Methods for Sequence Analysis, Oxford University Press, 1988.
17. [17] Ming Li, Towards a DNA Sequencing Theory, Proc. of 31st IEEE Syrup. on Foundation of Computer Science, 125-134 1990.
18. [18] T. Luczak and W. Szpankowski, A Lossy Data Compression Based on an Approximate Pattern Matching, IEEE Trans. Information Theory, to appear; also Purdue University, CSD-TR-94-072, 1994.
19. [19] P. Pevzner, l-tuple DNA Sequencing: Computer Analysis, J. Biomolecular Structure and Dynamics, 7, 63-73, 1989.
20. [20] B. Pittel, Asymptotic Growth of a Class of Random Trees, Ann. Probab., 18, 414-427, 1985.
21. [21] P. Shields, Entropy and Prefixes, Ann. Probab., 20, 403-409, 1992.
22. [22] W. Szpankowski, The Evaluation of an Alternative (sic!) Sum with Applications to the Analysis of Some Data Structures, Information Processing Letters, 28, 13-19, 1988.
23. [23] W. Szpankowski, A Generalized Suffix Tree and its (Un)Expected Asymptotic Behaviors, SIAM J. Computing, 22, pp. 1176-1198, 1993.
24. [24] S. Teng and F. Yao, Approximating Shortest Superstring, Proc. FOCS, 158-165, 1993.
25. [25] E. Ukkonen, A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings, Algorithmica, 5,313-323, 1990.
26. [26] E. Ukkonen, Approximate String-Matching over Suffix Trees, Proc. Combinatorial Pattern Matching, 228-242, Padova, 1993.
27. [27] E-H. Yang and Z. Zhang, The Shortest Common Superstring Problem: Average Case Analysis for Both Exact Matching and Approximate Matching, preprint.