Combinatorial Pattern Matching

DOI10.1007/b98377zbMath1103.68658MaRDI QIDQ5315356

Michal Ziv-Ukelson, Oleg Rokhlenko, Dekel Tsur, Ron Yair Pinter

Publication date: 7 September 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Generalized LCS ⋮ New dissimilarity measure for recognizing noisy subsequence trees ⋮ Approximate labelled subtree homeomorphism ⋮ Covering a Tree by a Forest ⋮ Constrained tree inclusion

This page was built for publication: Combinatorial Pattern Matching