On the maximum common embedded subtree problem for ordered trees
The maximum common embedded subtree problem, which generalizes the subtree homeomorphism problem, is reduced for ordered trees to a variant of the longest common subsequence problem, called the longest common balanced sequence problem. While the maximum common embedded subtree problem is known to be...
| Autor: | |
|---|---|
| Formato: | informe técnico |
| Fecha de publicación: | 2003 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/97381 |
| Acesso em linha: | https://hdl.handle.net/2117/97381 |
| Access Level: | acceso abierto |
| Palavra-chave: | Maximum common embedded subtree Subtree homeomorphism Longest common balanced sequence Combinatorial problems Graph algorithms Trees String algorithms Pattern matching subtree isomorphism Àrees temàtiques de la UPC::Informàtica |
| Resumo: | The maximum common embedded subtree problem, which generalizes the subtree homeomorphism problem, is reduced for ordered trees to a variant of the longest common subsequence problem, called the longest common balanced sequence problem. While the maximum common embedded subtree problem is known to be APX-hard for unordered trees, an exact solution for ordered trees can be found in polynomial time. A dynamic programming algorithm is presented that solves the longest common balanced sequence problem, and thus the maximum common embedded subtree problem, in (m^2n^2)$ time, where m and n are the number of edges in the trees. |
|---|