Why greed works for shortest common superstring problem

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

Volumn 5029 LNCS, Issue , 2008, Pages 244-254

  Ma, Bin ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BOOLEAN FUNCTIONS; DNA; GENES; NUCLEIC ACIDS; ORGANIC ACIDS; PATTERN MATCHING; PERTURBATION TECHNIQUES; PHASE MODULATION; RANDOM PROCESSES;

APPROXIMATION RATIOS; ASYMPTOTICALLY OPTIMAL; DNA SEQUENCE ASSEMBLY; DNA SEQUENCING; EVOLUTION (CO); GREEDY ALGORITHMS; RANDOM INSTANCES; RANDOM PERTURBATIONS; SHORTEST COMMON SUPERSTRING (SCS); SMOOTHED ANALYSIS; STRING COMPRESSION; WORST CASE;

DNA SEQUENCES;

EID: 45849146984     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69068-9_23     Document Type: Conference Paper

References (21)

1. Armen, C., Stein, C.: A 2 2/3-approximation algorithm for the shortest superstring problem. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 87-101. Springer, Heidelberg (1996)
2. Rebaï, A.S., Elloumi, M.: Approximation algorithm for the shortest approximate common superstring problem. In: Proc. 12th Word Academy of Science, Engineering and Technology, pp. 302-307 (2006)
3. Bellare, M., Goldreich, O., Sudan, M.: Free bits, pcps and non-approximability -towards tight results. SIAM Journal on Computing 27, 804-915 (1998)
4. Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear Approximation of Shortest Superstrings. Journal of the Association for Computer Machinery 41(4), 630-647 (1994)
5. Breslauer, D., Jiang, T., Jiang, Z.: Rotations of periodic strings and short super-strings. Journal of Algorithms 24(2), 340-353 (1997)
6. Frieze, A.M., Szpankowski, W.: Greedy algorithms for the shortest common super-string that are asymptotically optimal. Algorithmica 21(1), 21-36 (1998)
7. Gallant, J., Maier, D., Storer, J.: On finding minimal length superstrings. Journal of Computer and System Sciences 20, 50-58 (1980)
8. Storer, J.: Data Compression: Methods and Theory. Addison-Wesley, Reading (1988)
9. Tarhio, J., Ukkonen, E.: A greedy approximation algorithm for constructing shortest common superstrings. Theoretical Computer Science 57, 131-145 (1988)
10. Turner, J.: Approximation algorithms for the shortest common superstring problem. Information and Computation 83, 1-20 (1989)
11. Kaplan, H., Shafrir, N.: The greedy algorithm for shortest superstrings. Information Processing Letters 93, 13-17 (2005)
12. Li, M.: Towards a DNA sequencing theory. In: Proc. of the 31st IEEE Symposium on Foundations of Computer Science, pp. 125-134 (1990)
13. Waterman, M.S.: Introduction to Computational Biology: Maps, Sequences, and Genomes. Chapman and Hall, Boca Raton (1995)
14. Romero, H.J., Brizuela, C.A., Tchernykh, A.: An experimental comparison of approximation algorithms for the shortest common superstring problem. In: Proc. Fifth Mexican International Conference in Computer Science (ENC 2004), pp. 27-34 (2004)
15. Shapiro, M.B.: An algorithm for reconstructing protein and RNA sequences. Journal of ACM 14(4), 720-731 (1967)
16. Spielman, D.A., Teng, S.-H.: Smoothed analysis: Motivation and discrete models. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 256-270. Springer, Heidelberg (2003)
17. Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of ACM 51(3), 385-463 (2004)
18. Sweedyk, Z.: 2.5-approximation algorithm for shortest superstring. SIAM Journal on Computing 29(3), 954-986 (2000)
19. Teng, S.H., Yao, F.: Approximating shortest superstrings. In: Proc. 34th IEEE Symposium on Foundations of Computer Science, pp. 158-165 (1993)
20. Vassilevska, V.: Explicit inapproximability bounds for the shortest superstring problem. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 793-800. Springer, Heidelberg (2005)
21. Yang, E.H., Zhang, Z.: Shortest common superstring problem: average case analysis for both exact and approximate matching. IEEE Transactions on Information Theory 45(6), 1867-1886 (1999)