An Approximation Algorithm for Alignment of Multiple Sequences using Motif Discovery

Journal of Combinatorial Optimization

Volumn 3, Issue 2-3, 1999, Pages 247-275

  Parida, Laxmi ^a   Floratos, Aris ^a   Rigoutsos, Isidore ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Alignment number; Approximate algorithm; MAX SNP hard; Motif discovery; Multiple sequence alignment; Protein sequences; Set covering problem

Indexed keywords

EID: 0000050663     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1009841927822     Document Type: Article

References (21)

1. S. Altschul, "Gap costs for multiple sequence alignment," J. Theor. Biol., vol. 138, pp. 297-309, 1989.
2. S. Arora, D. Karger, and M. Karpinski, "Polynomial time approximation schemes for dense instances of NP-hard problems," in Proc. STOC, 1996.
3. S. Arora and C. Lund, "Hardness of approximations," in Approximation Algorithms for NP-Hardness Problems, D.S. Hochbaum (Ed.), PWS Publishing Company: MA, 1997.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, "Proof verification and hardness of approximation problems," in Proc. of the 33th IEEE Symposium on the Foundations of Computer Science, 1992.
5. H. Carrillo and D. Lipman, "The multiple sequence alignment problem in biology," SIAM Journal of Applied Mathematics, vol. 22, pp. 1073-1082, 1988.
6. K.M. Chao, R. Hardison, and W. Miller, "Recent developments in linear-space alignment methods: A survey," J. Computational Biology, vol. 3, pp. 271-291, 1994.
7. V. Chvátal, "A greedy heuristic for the set covering problem," Math. Oper. Res., vol. 4, pp. 233-235, 1979.
8. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, The MIT Press: Cambridge, MA, 1990.
9. U. Feige, "A threshold of ln n for approximating set cover," in Proc. 28th Ann. ACM Symp. on Theory of Comp., 1996, pp. 314-318.
10. S.K. Gupta, J. Kececioglu, and A.A. Schaffer, "Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment," Journal of Computational Biology, vol. 2, no. 3, pp. 459-472, 1995.
11. D. Higgins and P. Sharpe, "CLUSTAL: A package for performing multiple sequence alignment on a microcomputer," Gene, vol. 73, pp. 237-244, 1988.
12. M. Hirosawa, Y. Totoki, M. Hoshida, and M. Ishikawa, "Comprehensive study on iterative algorithms of multiple sequence alignment," CABIOS, vol. 11, no. 1, pp. 13-18, 1995.
13. D.S. Johnson, "Approximation algorithms for combinatorial problems," J. Comput. System Sci., vol. 7, pp. 256-278, 1974.
14. W. Miller, Z. Zhang, and B. He, "Local multiple alignment vis. subgraph enumeration," Discrete Applied Mathematics, vol. 71, pp. 337-365, 1996.
15. M.A. McClure, T.K. Vasi, and W.M. Fitch, "Comparative analysis of multiple protein-sequence alignment methods," Mol. Bio. Evol., vol. 11, no. 4 pp. 571-592, 1996.
16. L. Parida, "Algorithmic techniques in computational genomics," Ph.D. Thesis, Courant Institute of Mathematical Sciences, New York University, September 1998.
17. L. Parida, "On the approximability of physical map problems using single molecule methods," in Proceedings of Discrete Mathematics and Theoretical Computer Science (DMTCS 99), Auckland, January 1999, pp. 310-328.
18. I. Rigoutsos and A. Floratos, "Motif discovery in biological sequences without alignment or enumeration," in Proceedings of the Annual Conference on Computational Molecular Biology (RECOMB 98), ACM Press, 1998, pp. 221-227.
19. M. Vihinen, "An algorithm for simultaneous comparison of several sequences," CABIOS, vol. 4, pp. 89-92, 1998.
20. M.S. Waterman, "Parametric and ensemble alignment algorithms," Bulletin of Mathematical Biology, vol. 56, no. 4, pp. 743-767, 1994.
21. M.S. Waterman, An Introduction to Computational Biology: Maps, Sequences and Genomes, Chapman Hall, 1995.