
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabriel Valiente, Michal ZivUkelson, "Seeded Tree Alignment," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 5, no. 4, pp. 503513, OctoberDecember, 2008.  
BibTex  x  
@article{ 10.1109/TCBB.2008.59, author = {Antoni Lozano and Ron Y. Pinter and Oleg Rokhlenko and Gabriel Valiente and Michal ZivUkelson}, title = {Seeded Tree Alignment}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {5}, number = {4}, issn = {15455963}, year = {2008}, pages = {503513}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.59}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  Seeded Tree Alignment IS  4 SN  15455963 SP503 EP513 EPD  503513 A1  Antoni Lozano, A1  Ron Y. Pinter, A1  Oleg Rokhlenko, A1  Gabriel Valiente, A1  Michal ZivUkelson, PY  2008 KW  Graph algorithms KW  Graph Theory KW  Discrete Mathematics KW  Mathematics of Computing KW  Trees KW  Biology and genetics KW  Life and Medical Sciences KW  Computer Applications VL  5 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] M.J. Chung, “$O(n^{2.5})$ Time Algorithms for the Subgraph Homeomorphism Problem on Trees,” J. Algorithms, vol. 8, pp. 106112, 1987.
[2] B. DasGupta, X. He, T. Jiang, M. Li, J. Tromp, and L. Zhang, “On Distances between Phylogenetic Trees,” Proc. Eighth Ann. ACMSIAM Symp. Discrete Algorithms (SODA '97), pp. 427436, 1997.
[3] J.F. Dufayard, L. Duret, S. Penel, M. Gouy, F. Rechenmann, and G. Perrière, “Tree Pattern Matching in Phylogenetic Trees: Automatic Search for Orthologs or Paralogs in Homologous Gene Sequence Databases,” Bioinformatics, vol. 21, no. 11, pp. 25962603, 2005.
[4] J. Felsenstein, “Phylip—Phylogeny Inference Package (Version3.2),” Cladistics, vol. 5, no. 1, pp. 164166, 1989.
[5] U. Fößmeier and M. Kaufmann, “Nice Drawings for Planar Bipartite Graphs,” Proc. Third Italian Conf. Algorithms and Complexity (CIAC '97), vol. 1203, pp. 122134, 1997.
[6] J.A. Gallian, “A Dynamic Survey of Graph Labeling,” Electronic J. Combinatorics, no. DS7, http://www.combinatorics.orgSurveys/, 2007.
[7] K.J. Gardiner, T.L. Marsh, and N.R. Pace, “Ion Dependence of the Bacillus Subtilis RNase P Reaction,” J. Biological Chemistry, vol. 260, no. 9, pp. 54155419, 1985.
[8] E.S. Haas and J.W. Brown, “Evolutionary Variation in Bacterial RNase P RNAs,” Nucleic Acids Research, vol. 26, no. 18, pp.40934099, 1998.
[9] J.K. Harris, E.S. Haas, D. Williams, D.N. Frank, and J.W. Brown, “New Insight into RNase P RNA Structure from Comparative Analysis of the Archaeal RNA,” RNA, vol. 7, no. 2, pp. 220232, 2001.
[10] P. Hugenholtz, “Exploring Prokaryotic Diversity in the Genomic Era,” Genome Biology, vol. 3, no. 2, pp. reviews0003.1reviews0003.8, 2002.
[11] B.D. James, G.J. Olsen, J. Liu, and N.R. Pace, “The Secondary Structure of Ribonuclease P RNA, the Catalytic Element of a Ribonucleoprotein Enzyme,” Cell, vol. 52, no. 1, pp. 1926, 1988.
[12] J. Jansson, N.T. Hieu, and W.K. Sung, “Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs,” J. Computational Biology, vol. 13, no. 3, pp. 702718, 2006.
[13] S.Y. Le, R. Nussinov, and J.V. Maizel, “Tree Graphs of RNA Secondary Structures and Their Comparisons,” Computers in Biomedical Research, vol. 22, no. 5, pp. 461473, 1989.
[14] A. Lozano, R. Pinter, O. Rokhlenko, G. Valiente, and M. ZivUkelson, “Seeded Tree Alignment and Planar Tanglegram Layout,” Proc. Seventh Workshop Algorithms in Bioinformatics (WABI'07), vol. 4645, pp. 98110, 2007.
[15] B.L. Maidak, J.R. Cole, T.G. Lilburn, C.T. Parker, P.R. Saxman, J.M. Stredwick, G.M. Garrity, B. Li, G.J. Olsen, S. Pramanik, T.M. Schmidt, and J.M. Tiedje, “The RDP (Ribosomal Database Project) Continues,” Nucleic Acids Research, vol. 28, pp. 173174, 2000.
[16] D.W. Matula, “An Algorithm for Subtree Identification,” SIAM Rev., vol. 10, pp. 273274, 1968.
[17] D. Matula, “Subtree Isomorphism in $O(n^{5/2})$ ,” Annals Discrete Math., vol. 2, pp. 91106, 1978.
[18] T.M. Nye, P. Lio, and W.R. Gilks, “A Novel Algorithm and WebBased Tool for Comparing Two Alternative Phylogenetic Trees,” Bioinformatics, vol. 22, no. 1, pp. 117119, 2006.
[19] N.R. Pace and J.W. Brown, “Evolutionary Perspective on the Structure and Function of Ribonuclease P, A Ribozyme,” J.Bacteriology, vol. 177, no. 8, pp. 19191928, 1995.
[20] R.D.M. Page, ed., Tangled Trees: Phylogeny, Cospeciation, and Coevolution. The Univ. of Chicago Press, 2002.
[21] R.D.M. Page and G. Valiente, “An Edit Script for Taxonomic Classifications,” BMC Bioinformatics, vol. 6, p. 208, 2005.
[22] R.Y. Pinter, O. Rokhlenko, D. Tsur, and M. ZivUkelson, “Approximate Labelled Subtree Homeomorphism,” Proc. 15th Ann. Symp. Combinatorial Pattern Matching (CPM '04), vol. 3109, pp.5973, 2004.
[23] S.W. Reyner, “An Analysis of a Good Algorithm for the Subtree Problem,” SIAM J. Computing, vol. 6, no. 4, pp. 730732, 1977.
[24] R. Shamir and D. Tsur, “Faster Subtree Isomorphism,” J.Algorithms, vol. 33, no. 2, pp. 267280, 1999.
[25] H. Shan, K.G. Herbert, W.H. Piel, D. Shasha, and J.T.L. Wang, “AStructureBased Search Engine for Phylogenetic Databases,” Proc. 14th Int'l Conf. Scientific and Statistical Database Management (SSDBM '02), pp. 710, 2002.
[26] B.A. Shapiro and K. Zhang, “Comparing Multiple RNA Secondary Structures Using Tree Comparisons,” Computer Applications in the Biosciences, vol. 6, no. 4, pp. 309318, 1990.
[27] D. Shasha, J.T.L. Wang, and R. Giugno, “Algorithmics and Applications of Tree and Graph Searching,” Proc. 21st ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems (PODS '02), pp. 3952, 2002.
[28] G. Valiente, Algorithms on Trees and Graphs. Springer, 2002.
[29] G. Valiente, “Constrained Tree Inclusion,” J. Discrete Algorithms, vol. 3, nos. 24, pp. 431447, 2005.
[30] G. Valiente, “A Fast Algorithmic Technique for Comparing Large Phylogenetic Trees,” Proc. 12th Int'l Symp. String Processing and Information Retrieval (SPIRE '05), vol. 3772, pp. 371376, 2005.
[31] C.R. Woese and N.R. Pace, “Probing RNA Structure, Function, and History by Comparative Analysis,” The RNA World, R.F.Gesteland and J.F. Atkins, eds., pp. 91117, Cold Spring Harbor Laboratory Press, 1993.
[32] W.N.W. Zainon and P. Calder, “Visualizing Phylogenetic Trees,” Proc. Seventh Australasian User Interface Conf. (AUIC'06), pp. 145152, 2006.
[33] K. Zhang, L. Wang, and B. Ma, “Computing Similarity between RNA Structures,” Proc. 10th Ann. Symp. Combinatorial Pattern Matching (CPM '99), vol. 1645, pp. 281293, 1999.