Local multiple alignment via subgraph enumeration

Discrete Applied Mathematics

Volumn 71, Issue 1-3, 1996, Pages 337-365

  Zhang, Z ^a   He, B ^a   Miller, W ^a  

^a The Pennsylvania State University   (United States)

Author keywords

Maximal clique; Multiple alignment; Sequence comparison; Subgraph enumeration

Indexed keywords

EID: 0006915882     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00072-8     Document Type: Article

References (28)

1. M. Boguski, R. C. Hardison, S. Schwartz and W. Miller, Analysis of conserved domains and sequence motifs in cellular regulatory proteins and locus control regions using new software tools for multiple alignment and visualization, New Biologist 4 (1992) 247-260.
2. C. Bron and J. Kerbosch, Algorithm 457: finding all cliques of an undirected graph, Comm. ACM 16 (1973) 575-577.
3. K.-M. Chao and W. Miller, Linear-space algorithms that build local alignments from fragments, Algorithmica 13 (1995) 106-134.
4. T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms (McGraw-Hill, New York, 1990).
5. D. Eppstein, Z. Galil, R. Giancarlo and G. F. Italiano, Sparse dynamic programming. I: linear cost functions, II: convex and concave cost functions, J. ACM 39 (1992) 519-567.
6. M. R. Garey and D. S. Johnson, Computers and Intractability (Freeman, Co. New York, 1979).
7. L. Goldberg, Efficient Algorithms for Listing Combinatorial Structures (Cambridge Univ. Press, Cambridge, 1993).
8. S. Gupta, J. Kececioglu and A. Schäffer, Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment, J. Computat. Biol. 2 (1995) 459-472.
9. D. Gusfield, Efficient methods for multiple sequence alignment with guaranteed error bounds, Bull. Math. Biol. 55 (1993) 141-154.
10. 5/2 algorithm for maximum matchings in bipartite graphs, SIAM J. Comput. 2 (1973) 225-231.
11. X. Huang and W. Miller, A time-efficient, linear-space local similarity algorithm, Adv. Appl. Math. 12 (1991) 337-357.
12. D. Johnson, M. Yannakakis and C. Papadimitriou, On generating all maximal independent sets, Inform Process Lett. 27 (1988) 119-123.
13. E. Lawler, J. Lenstra and A. Rinnooy Kan, Generating all maximal independent sets: NP-hardness and polynomial-time algorithms, SIAM J. Comput. 9 (1980) 558-565.
14. C. Lawrence, S. Altschul, M. Boguski, J. Liu, A. Neuwald and J. Wooton, Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment, Science 262 (1993) 208-214.
15. W. Miller, Building multiple alignments from pairwise alignments, CABIOS 9 (1993) 169-176.
16. W. Miller, M. Boguski, B. Raghavachari, Z. Zhang and R. Hardison, Constructing aligned sequence blocks, J. Computat. Biol. 1 (1994) 51-64.
17. E. Myers and W. Miller, Chaining multiple-alignment fragments in sub-quadratic time, Proceedings of the 6 th Annual ACM-SIAM Symposium on Discrete Algorithms (1995) 38-47.
18. A. Neuwald and P. Green, Detecting patterns in protein sequences, J. Mol. Biol. 239 (1994) 698-712.
19. J. Pósfai, Z. Száraz and R. Roberts, VISA: visual sequence analysis for the comparison of multiple amino acid sequences, CABIOS 10 (1994) 537-544.
20. G. Schuler, S. Altschul and D. Lipman, A workbench for multiple alignment construction and analysis, Proteins: Struct., Funct. Gene. 9 (1991) 180-190.
21. S. Schwartz, W. Miller, C.-M. Yang and R. C. Hardison, Software tools for analyzing pairwise sequence alignments, Nucleic Acid Res. 19 (1991) 4663-4667.
22. J. Thompson, D. Higgins and T. Gibson, CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice, Nucleic Acids Res. 22 (1994) 4673-4680.
23. S. Tsukiyama, M. Ide, H. Ariyoshi and I. Shirakawa, A new algorithm for generating all the maximal independent sets, SIAM J. Comput. 6 (1977) 505-517.
24. M. Vihinen, An algorithm for simultaneous comparison of several sequences, CABIOS 4 (1988) 89-92.
25. M. Vingron and P. Argos, Motif recognition and alignment for many sequences by comparison of dot-matrices, J. Mol. Biol. 218 (1991) 33-43.
26. M. Vingron and P. Pevzner, Multiple sequence comparison and consistency on multipartite graphs, Adv. Appl. Math. 16 (1995) 1-22.
27. L. Wang and T. Jiang, On the complexity of multiple sequence alignment, J. Computat. Biol. 1 (1994) 337-348.
28. Z. Zhang, B. Raghavachari, R. Hardison and W. Miller, Chaining multiple-alignment blocks, J. Computat. Biol. 1 (1994) 217-226.