On-Line Construction of Two-Dimensional Suffix Trees in O(n² log n) Time

By Na Joong Chae   Giancarlo Raffaele   Park Kunsoo  

Algorithmica, Vol. 48, Iss. 2, 2007-06 ,pp. : 173-186

Springer Publishing Company

Access to resources Recommend Favorite

Fully dynamic distributed search trees can be balanced in O(lg² N) time

By Barillari F.   Nardelli E.   Pepe M.  

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 11, 2002-11 ,pp. : 1617-1628

Academic Press

Access to resources Recommend Favorite

Maximum tree-packing in time O(n 52 )

By Lingas A.  

Theoretical Computer Science, Vol. 181, Iss. 2, 1997-07 ,pp. : 307-316

Elsevier

Access to resources Recommend Favorite

An O(n) time hierarchical tree algorithm for computing force field in n-body simulations

By Guoliang X.  

Theoretical Computer Science, Vol. 197, Iss. 1, 1998-05 ,pp. : 157-169

Elsevier

Access to resources Recommend Favorite

Molecular dynamics simulation of Matrix Metalloproteinase 2: fluctuations and time evolution of recognition pockets

By Falconi Mattia   Altobelli Gioia   Iovino Maria Cristina   Politi Vincenzo   Desideri Alessandro  

Journal of Computer-Aided Molecular Design, Vol. 17, Iss. 12, 2003-12 ,pp. : 837-848

Springer Publishing Company

Access to resources Recommend Favorite