Multiple alignment with guaranteed error bounds and communication cost
Multiple sequence alignment is an important problem in computational molecular biology. Dynamic programming for optimal multiple alignment requires too much time to be practical. Although many algorithms for suboptimal alignment have been suggested, no ‘performance guarantees’ algorithms have been known until recently. We give an approximation multiple alignment algorithm with guaranteed error bounds equal to the normalized communication cost of a corresponding graph.
Unable to display preview. Download preview PDF.
- 1.Chan S.C., Wong A.K.C., Chiu D.K.Y.: A survey of multiple sequence comparison methods. Bull. Math. Biol. (1992) (in press)Google Scholar
- 2.Feng D., Doolittle R.: Progressive sequence alignment as a prerequisite to correct phylogenetic trees. Journal of Molec. Evol. 25 (1987) 351–360Google Scholar
- 3.Gabow H.H.: An efficient implementation of Edmonds' algorithm for maximum matching on graphs. J.ACM. 23 (1976) 221–234Google Scholar
- 4.Galil Z.: Sequential and parallel algorithms for finding maximal matching in graphs. Ann. Rev. of Comp. Sci. 1 (1986) 197–224Google Scholar
- 5.Gusfield D.: Efficient method for multiple sequence alignment with guaranteed error bounds. Technical Report, Computer Science Division, University of California, Davis, CSE-91-4(1991) (to appear in Bull. of Math. Biol.)Google Scholar
- 6.Hu T.C.: Optimum communication spanning trees. SIAM J. Comput. 3 (1974) 188–195Google Scholar
- 7.Maier D.: The complexity of some problems on subsequences and supersequences. J. ACM 25 (1978) 322–336Google Scholar
- 8.P.A. Pevzner.: Multiple alignment, communication cost, and graph matching. SIAM J. Appl. Math. (1992) (in press)Google Scholar
- 9.Timkovsky V.G.: The complexity of subsequence, supersequences and related problems. Kibernetika. 5 (1989) 1–13 (in Russian)Google Scholar
- 10.Waterman M.S., Perlwitz M.D.: Line geometries for sequence comparison. Bull. of Math. Biol. 46 (1984) 567–577Google Scholar