@article{aho89:paper,
       author = "A. V. Aho and M. Ganapathi and S. W. K. Tjiang",
       title = "Code Generation using Tree Matching 
                and Dynamic Programming",
       journal = "ACM Trans. Programming Languages and Systems",
       volume = "11",
       number = "4",
       month = "Oct.",
       year = "1989",
       pages = "491-516"}

@phdthesis{amsler80:paper,
       author = "R. A. Amsler",
       title = "The Structure of the Merriam-Webster Pocket
               Dictionary",
       school = "University of Texas, Austin",
       year = "1980"}


@article{apostolico88:paper,
       author = "A. Apostolico and C. Iliopoulos and 
        G. M. Landau and B. Schieber and U. Vishkin",
       title = "Parallel Construction of a Suffix Tree
          with Applications",
       journal = "Algorithmica",
       volume = "3",
       year = "1988",
       pages = "347-365"}



@techreport{byrd90:paper,
      author = "R. Byrd",
      title = "{LQL} User Notes: An Informal Guide
              to the Lexical Query Language",
      institution = "IBM T. J. Watson Research Center, New York",
      year = "1990"}


@inproceedings{cai90:paper,
      author = "J. Cai and R. Paige and R. Tarjan",
      title = "More Efficient Bottom-Up Tree Pattern Matching",
      booktitle = "Proc. {ICAAP}'90",
      publisher = "Springer-Verlag",
      month = "May",
      year = "1990",
      pages = "72-86"}


@article{cheng85:paper,
      author = "Y. C. Cheng and S. Y. Lu",
      title = "Waveform Correlation
               by Tree Matching",
      journal = "IEEE Trans. Pattern Anal. Mach. Intell.",
      volume = "7",
      year = "1985",
      month = "May",
      pages = "299-305"}


@inproceedings{chodorow85:paper,
      author = "M. S. Chodorow and R. J. Byrd and G. E. Heidorn",
      title = "Extracting Semantic Hierarchies from a Large
               On-Line Dictionary",
      booktitle = "Proc. Annual Meetings of the 
               Association for Computational Linguistics",
      year = "1985",
      pages = "299-304"}


@techreport{chodorow90:paper,
      author = "M. Chodorow and J. L. Klavans",
      title = "Locating Syntactic Patterns in Text Corpora",
      institution = "IBM T. J. Watson Research Center, New York",
      year = "1990"}

@inproceedings{dubiner90:paper,
     author = "M. Dubiner and Z. Galil and
               E. Magen",
     title = "Faster Tree Pattern Matching",
     booktitle = "Proc. 31st Annual Symp. on
	      Foundations of Computer Science",
     month = "Oct.",
     year = "1990",
     pages = "145-150"}


@article{ehrich76:paper,
      author = "R. W. Ehrich and J. P. Foith",
      title = "Representation of Random Waveforms by 
              Relational Trees",
      journal = "IEEE Trans. Comput.",
      volume = "25",
      year = "1976",
      pages = "725-736"}


@article{fu73:paper,
        author = "K. S. Fu and B. K. Bhargava",
        title = "Tree Systems for Syntactic Pattern Recognition",
        journal = "IEEE Trans. Comptrs.",
        volume = "C-22",
        number = "12",
        year = "1973",
        month = "Dec.",
        pages = "1087-1099"}


@article{galil83:paper,
       author = "Z. Galil and J. I. Seiferas",
       title = "Time-Space-Optimal String Matching",
       journal = "J. Comput. System Sci.",
       volume = "26",
       year = "1983",
       pages = "280-294"}

@article{galil86:paper,
      author = "Z. Galil and R. Giancarlo",
      title = "Improved String Matching with $k$ Mismatches",
      journal = "SIGACT News",
      volume = "17",
      number = "4",
      year = "1986",
      pages = "52-54"}
      
@article{galil90:paper,
      author = "Z. Galil and K. Park",
      title = "An Improved Algorithm for Approximate 
        String Matching",
      journal = "SIAM J. Comput.",
      volume = "19",
      number = "6",
      month = "Dec.",
      year = "1990",
      pages = "989-999"}


@article{hoffmann82:paper,
      author = "C. M. Hoffmann and M. J. O'Donnell",
      title = "Pattern Matching in Trees",
      journal = "J. ACM",
      volume = "29",
      year = "1982",
      pages = "68-95"}


@inproceedings{karp72:paper,
       author = "R. Karp and R. E. Miller and A. Rosenberg",
       title = "Rapid Identification of Repeated Patterns in Strings,
                Trees and Arrays",
       booktitle = "Proc. 4th Ann. ACM Symp. on Theory of Computing",
       organization = "ACM",
       year = "1972",
       pages = "125-136"}

@article{karp87:paper,
       author = "R. M. Karp and M. O. Rabin",
       title = "Efficient Randomized Pattern-Matching Algorithms",
       journal = "IBM J. Res. Develop.",
       volume = "31",
       number = "2",
       year = "1987",
       pages = "249-260"}

@inproceedings{kosaraju89:paper,
      author = "S. R. Kosaraju",
      title = "Efficient Tree Pattern Matching",
      booktitle = "Proc. 30th Annual Symp. on Foundations of
		    Computer Science",
      month = "Oct.",
      year = "1989",
      pages = "178-183"}


@phdthesis{kron75:thesis,
       author = "H. Kron",
       title = "Tree Templates and Subtree Transformational Grammars",
       school = "Univ. of California, Santa Cruz, Calif.",
       year = "1975"}


@inproceedings{landau85:paper,
       author = "G. M. Landau and U. Vishkin",
       title = "Efficient String Matching in the Presence of
                Errors",
       booktitle = "Proceedings 26th IEEE FOCS",
       year = "1985",
       pages = "126-136"}




@article{landau86a:paper,
       author = "G. M. Landau and U. Vishkin",
       title = "Efficient String Matching with $k$ Mismatches",
       journal = "Theoret. Comput. Sci.",
       volume = "43",
       year = "1986",
       pages = "239-249"}


@article{landau88:paper,
       author = "G. M. Landau and U. Vishkin",  
       title = "Fast String Matching with $k$ Differences",
       journal = "J. Comput. System Sci.",
       volume = "37",
       number = "1",
       year = "1988",
       pages = "63-78"}

@inproceedings{landau86:paper,
     author = "G. M. Landau and U. Vishkin",
     title = "Introducing Efficient Parallelism
              into Approximate String Matching",
     booktitle = "Proc. 18th ACM Symposium on Theory 
                  of Computing",
     year = "1986",
     pages = "220-230"}
  


@article{landau89:paper,
       author = "G. M. Landau and U. Vishkin",
       title = "Fast Parallel and Serial Approximate 
                String Matching",
       journal = "J. Algorithms",
       volume = "10",
       year = "1989",
       pages = "157-169"}

@inproceedings{markowitz86:paper,
       author = "J. Markowitz and T. Ahlswede and M. Evans",
       title = "Semantically Significant Patterns 
           in Dictionary Definitions",
       booktitle = "Proc. Annual Meeting of the Association
         for Computational Linguistics",
       year = "1986",
       pages = "112-119"}

@article{mccreight76:paper,
       author = "E. M. McCreight",
       title = "A Space-Economical
                Suffix Tree Construction
                Algorithm",
       journal = "J. Assoc. Comput. Mach.",
       volume = "23",
       year = "1976",
       pages = "262-272"}

         

@article{moayer86:paper,
       author = "B. Moayer and K. S. Fu",
       title = "A Tree System Approach for Fingerprint 
                Pattern Recognition",
       journal = "IEEE Trans. Pattern Anal. Machine Intell.",
       volume = "8",
       month = "May",
       year = "1986",
       pages = "376-387"}


@article{myers89:paper,
       author = "E. W. Myers and W. Miller",
       title = "Approximate Matching of Regular Expressions",
       journal = "Bulletin of Mathematical Biology",
       volume = "51",
       number = "1",
       year = "1989",
       pages = "5-37"}

@inproceedings{neff88:paper,
       author = "M. Neff and R. Byrd and O. Rizk",
       title  = "Creating and Querying Hierarchical Lexical Data
                 Bases",
       booktitle = "Proc. 2nd Conf. Applied Natural Language Processing",
       year = "1988",
       pages = "84-93"}


@inproceedings{neff89:paper,
       author = "M. Neff and B. K. Boguraev",
       title = "Dictionaries, Dictionary Grammars and Dictionary
               Entry Parsing",
       booktitle = "Proc. 27th Annual Meeting 
       of the Association for Computational Linguistics",
       month = "June",
       year = "1989"}

@incollection{pinter85:paper,
        author = "R. Y. Pinter",
        title = "Efficient String Matching with Don't Care Patterns",
        booktitle = "Combinatorial Algorithms on Words",
        publisher = "Springer-Verlag",
        year = "1985",
        editor = "A. Apostolico and Z. Galil",
        pages = "11-29"}


         

@article{samet82:paper,
       author = "H. Samet",
       title = "Distance Transform for Images Represented 
                by Quadtrees",
       journal = "IEEE Trans. on Pattern Anal. Machine Intell.",
       volume = "4",
       number = "3",
       year = "1982",
       month = "May",
       pages = "298-303"}



@article{selkow77:paper,
        author = "S. M. Selkow",
        title = "The Tree-to-Tree Editing Problem",
        journal = "Inform. Processing Letters",
        volume = "6",
        number = "6",
        year = "1977",
        month = "Dec.",
        pages = "184-186"}

@article{sellers74:paper,
       author = "P. H. Sellers",
       title = "An Algorithm for the Distance between Two Finite Sequences",
       journal = "J. Combin. Theory",
       volume = "Ser. A",
       number = "16",
       year = "1974",
       pages = "253-258"}


@article{sellers80:paper,
      author = "P. H. Sellers",
      title = "The Theory and Computation of Evolutionary Distances",
      journal = "J. Algorithms",
      volume = "1",
      year = "1980",
      pages = "359-373"}

@article{sellers84:paper,
     author = "P. H. Sellers",
     title = "Pattern Recognition in Genetic Sequences by Mismatch Density",
     journal = "Bull. Math. Biol.",
     volume = "46",
     year = "1984",
     pages = "501-514"}


@article{shapiro90:paper,
     author = "B. A. Shapiro and K. Zhang",
     title = "Comparing Multiple {RNA} Secondary Structures 
              Using Tree Comparisons",
     journal = "Comput. Appl. Biosci.",
     volume = "6",
     number = "4",
     year = "1990",
     pages = "309-318"}


@article{shasha90a:paper,
      author = "D. Shasha and T. L. Wang",
      title = "New Techniques for Best-Match Retrieval",
      journal = "ACM Transactions on Information Systems",
      volume = "8",
      number = "2",
      month = "Apr.",
      year = "1990",
      pages = "140-158"}


@article{shasha90b:paper,
      author = "D. Shasha and K. Zhang",
      title = "Fast Algorithms for the
          Unit Cost Editing Distance between Trees",
      journal = "J. Algorithms",
      volume = "11",
      number = "4",
      year = "1990",
      pages = "581-621"}


@article{smith81:paper,
      author = "T. F. Smith and W. A. Beyer",
      title = "Some Biological Sequence Metrics",
      journal = "Adv. Maths",
      volume = "20",
      year = "1976",
      pages = "367-387"}


@article{sussman76:paper,
      author = "J. L. Sussman and S. H. Kim",
      title = "Three Dimensional Structure of a Transfer 
                  {RNA} in Two Crystal Forms",
      journal = "Science",
      volume = "192",
      year = "1976",
      pages = "853"}


@article{tai79:paper,
       author = "K.-C. Tai",
       title = "The Tree-to-Tree
                Correction Problem",
       journal = "JACM", 
       volume  = "26",
       number = "3",
       year = "1979",
       pages = "422-433"}


@article{ukkonen85:paper,
       author = "E. Ukkonen",
       title = "Finding Approximate Pattern in Strings",
       journal = "J. Algorithms",
       volume = "6",
       year = "1985",
       pages = "132-137"}



@article{wagner74:paper,
       author = "R. A. Wagner and M. J. Fischer",
       title = "The String-to String Correction Problem",
       journal = "J. ACM",
       volume = "21",
       number = "1",
       year = "1974",
       month = "Jan.",
       pages = "168-173"}

@techreport{wang91:manual,
        author = "J. T. L. Wang and K. Jeong and K. Zhang and D. Shasha",
        title = "Reference Manual for {ATBE}: A Tool for
         Approximate Tree Matching",
        institution = "Courant Institute of 
         Mathematical Sciences, New York University",
        number = "TR-551",
        month = "Mar.",
        year = "1991",
        pages = "1-57"}

@inproceedings{wang91:paper,
      author = "J. T. L. Wang and K. Zhang and K. Jeong and D. Shasha",
      title = "A Tool for Tree Pattern Matching",               
      booktitle = "Proc. 3rd IEEE Int'l Conf. on Tools for AI",
      year = "1991",
      pages = "436-444"}


@inproceedings{weiner73:paper,
      author = "P. Weiner",
      title = "Linear Pattern Matching Algorithm",
      booktitle = "Proc. 14th IEEE Symposium on Switching
            and Automata Theory",
      year = "1973",
      pages = "1-11"}



@techreport{wu91:manual,   
        author = "S. Wu and U. Manber",  
        title = "Fast Text Searching with Errors",       
        institution = "Department of Computer Science,
         University of Arizona",                      
        number = "TR 91-11", 
        month = "Jun.",
        year = "1991"}  

@phdthesis{zhang89:thesis,
       author = "K. Zhang",
       title = "The Editing Distance
                between Trees: Algorithms and 
                Applications",
       school = "New York University",
       address = "Courant Institute of Mathematical Sciences",
       year = "1989"}

 
@article{zhang89:paper,
        author = "K. Zhang and D. Shasha",
        title  = "Simple Fast Algorithms for
                  the Editing Distance between Trees 
                  and Related Problems",
        journal = "SIAM J. Computing",
        volume = "18",
        number = "6",
        month = "Dec.",
        year = "1989",
        pages = "1245-1262"}