Universidad Complutense de Madrid
E-Prints Complutense

Average-case analysis of pattern-matching in trees under the BST probability model



Último año

Sánchez Couso, José Ramón y Fernández Camacho, María Inés (1994) Average-case analysis of pattern-matching in trees under the BST probability model. In Automata, Languages and Programming. Lecture notes in computer science (820). Springer, pp. 178-190. ISBN 978-3-540-58201-4

URL Oficial: http://link.springer.com/chapter/10.1007%2F3-540-58201-0_67

URLTipo de URL


We analyze the average behaviour under the bst probability model of the simplest and most commonly used sequential tree-matching algorithm. When the uniform probability model for the input is assumed, it is well known that it takes O(n) steps on average to search all occurrences of a random pattern P in a random text T of joint size n. Under the bst probability model the analysis is itself more complex, involving the solution of partial differential equations. Nevertheless the difficulty to solve one of partial differential equations concerned leads us to seek for analytic properties of that solution which allow us to conclude, without the explicit knowledge of that solution, the main result: searching for all occurrences of a random pattern in a random binary tree of joint size n and distributed accordingly to the bst probability model is O(n ln n) on the average.

Tipo de documento:Sección de libro
Información Adicional:

21st International Colloquium, ICALP 94 Jerusalem, Israel, July 11–14, 1994 Proceedings

Palabras clave:Analysis of algorithms and problem complexity
Materias:Ciencias > Informática
Código ID:20608
Depositado:01 Abr 2013 11:39
Última Modificación:01 Abr 2013 11:39

Descargas en el último año

Sólo personal del repositorio: página de control del artículo