Identifying consensus of trees through alignment

Information sciences

Volumn 126, Issue 1, 2000, Pages 165-189

  Wang, Jason T L ^a   Zhang, Kaizhong ^b  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; NUCLEIC ACID SEQUENCES; PROBLEM SOLVING; RNA;

RNA SEQUENCES; SIMILAR CONSENSUS;

TREES (MATHEMATICS);

EID: 0034224873     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(00)00014-1     Document Type: Article

References (32)

1. Angluin D. Finding patterns common to a set of strings. Journal of Computer and System Sciences. 21:1980;46-62.
2. Burks C., Cassidy M., Cinkosky M.J., Cumella K.E., Gilna P., Hayden J.E.-D., Keen G.M., Kelley T.A., Kelly M., Kristofferson D., Ryals J. Genbank. Nucleic Acids Research. 19:1991;2221-2225.
3. Chen J.-H., Le S.-Y., Shapiro B.A., Currey K.M., Maizel J.V. A computational procedure for assessing the significance of RNA secondary structure. Computer Applications in the Biosciences. 6:1990;7-18.
4. Crochemore M. Transducers and repetitions. Theoretical Computer Science. 45:1986;63-86.
5. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completenes. 1979;W.H. Freeman, New York.
6. Jiang T., Wang L., Zhang K. Alignment of trees - An alternative to tree edit. Theoretical Computer Science. 143(1):1995;137-148.
7. S.K. Kannan, E.W. Myers, An algorithm for locating non-overlapping regions of maximum alignment score, in: A. Apostolico, M. Crochemore, Z. Galil, U. Manber (Eds.), Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 684, Springer, Berlin, 1993, pp. 74-86.
8. Konings D.A.M., Hogeweg P. Pattern analysis of RNA secondary structure - similarity and consensus of minimal energy folding. Journal of Molecular Biology. 207:1989;597-614.
9. Le S.-Y., Chen J.-H., Currey K.M., Maizel J.V. A program for predicting significant RNA secondary structures. Computer Applications in the Biosciences. 4:1988;153.
10. Main M.G., Lorentz R.J. An. O(NlogN) algorithm for finding all repetitions in a string Journal of Algorithms. 5:1984;422-432.
11. Margalit H., Shapiro B.A., Oppenheim A.B., Maizel J.V. Detection of common motifs in RNA secondary structures. Nucleic Acids Research. 17(12):1989;4829-4845.
12. Needleman S.B., Wunsch C.D. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology. 48:1970;443-453.
13. Sankoff D., Kruskal J.B. Time Warps String Edits and Macromolecules: The Theory and Practice of Sequence Comparision. 1983;Addison-Wesley, Reading, MA.
14. Shapiro B.A., Chen J.-H., Busse T., Navetta J., Kasprzak W., Maizel J.V. Optimization and performance analysis of a massively parallel dynamic programming algorithm for RNA secondary structure prediction. International Journal of Supercomputer Applications. 9(1):1995;29-39.
15. Shapiro B.A., Lipkin L.E., Maizel J.V. An interactive technique for the display of nucleic acid secondary structure. Nucleic Acids Research. 10:1982;7041-7052.
16. Shapiro B.A., Maizel J.V., Lipkin L.E., Currey K., Whitney C. Generating non-overlapping displays of nucleic acid secondary structure. Nucleic Acids Research. 12:1984;75-88.
17. Shapiro B.A., Zhang K. Comparing multiple RNA secondary structures using tree comparisons. Computer Applications in the Biosciences. 6(4):1990;309-318.
18. Shasha D., Wang J.T.L., Zhang K., Shih F.Y. Exact and approximate algorithms for unordered tree matching. IEEE Transactions on Systems, Man and Cybernetics. 24(4):1994;668-678.
19. Smith T.F., Waterman M.S. Identification of common molecular subsequences. Journal of Molecular Biology. 147(1):1981;195-197.
20. Studnicka G.M., Rahn G.M., Cummings I.W., Salser W. Computer method for predicting the secondary structure of single-stranded RNA. Nucleic Acids Research. 5:1978;3365-3387.
21. Tai K.-C. The tree-to-tree correction problem. Journal of ACM. 26(3):1979;422-433.
22. Turner D.H., Sugimoto N., Freier S.M. RNA structure predictions. Ann. Rev. Biophys. Chem. 17:1988;167-192.
23. Wang J.T.L., Shapiro B.A., Shasha D. Pattern Discovery in Biomolecular Data: Tools, Techniques and Applications. 1999;Oxford University Press, New York.
24. Wang J.T.L., Shapiro B.A., Shasha D., Zhang K., Currey K.M. An algorithm for finding the largest approximately common substructures of two trees. IEEE Transactions on Pattern Analysis and Machine Intelligence. 20(8):1998;889-895.
25. Wang J.T.L., Zhang K., Chang C.Y. Identifying approximately common substructures in trees based on a restricted edit distance. Information Sciences. 121(3-4):1999;367-386.
26. Wang J.T.L., Zhang K., Jeong K., Shasha D. A system for approximate tree matching. IEEE Transactions on Knowledge and Data Engineering. 6(4):1994;559-571.
27. Waterman M.S. Mathematical Methods for DNA Sequence Analysis. 1989;CRC Press, Boca Raton.
28. Waterman M.S., Byers T.H. A dynamic programming algorithm to find all solutions in a neighborhood of the optimum. Math. Biosci. 77:1985;179-188.
29. Watson J.D., Hopkins N.H., Roberts J.W., Argetsinger Steitz J., Weiner A.M. Molecular Biology of the Gene. 4th ed. 1987;Benjamin/Cummings Publishing Company, Menlo Park, CA.
30. Wolfram S. Principles of Nucleic Acids Structure. 1984;Springer, New York.
31. Zhang K., Shasha D. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing. 18(6):1989;1245-1262.
32. Zhang K., Shasha D., Wang J.T.L. Approximate tree matching in the presence of variable length don't cares. Journal of Algorithms. 16(1):1994;33-66.