Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Jiang:1995:ATA, author = "Tao Jiang and Lusheng Wang and Kaizhong Zhang", title = "Alignment of trees --- an alternative to tree edit", journal = j-THEOR-COMP-SCI, volume = "143", number = "1", pages = "137--148", day = "29", month = may, year = "1995", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Mon Jul 19 22:19:06 MDT 1999", bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1995&volume=143&issue=1; http://www.math.utah.edu/pub/tex/bib/tcs1995.bib", URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1995&volume=143&issue=1&aid=1867", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4240C (Computational complexity)", corpsource = "Dept. of Comput. Sci., McMaster Univ., Hamilton, Ont., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "alignment of trees; computational complexity; labeled trees; MAX SNP-hard; multiple alignment; polynomial time; time complexity; tree edit; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", }