A Linear Time Pattern Matching Algorithm Between a String and a Tree

Tatsuya Akutsu. A Linear Time Pattern Matching Algorithm Between a String and a Tree. In Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber, editors, Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings. Volume 684 of Lecture Notes in Computer Science, pages 1-10, Springer, 1993.

@inproceedings{Akutsu93,
  title = {A Linear Time Pattern Matching Algorithm Between a String and a Tree},
  author = {Tatsuya Akutsu},
  year = {1993},
  tags = {tree pattern matching, pattern matching},
  researchr = {https://researchr.org/publication/Akutsu93},
  cites = {0},
  citedby = {0},
  pages = {1-10},
  booktitle = {Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings},
  editor = {Alberto Apostolico and Maxime Crochemore and Zvi Galil and Udi Manber},
  volume = {684},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-56764-X},
}