Français Anglais
Accueil Annuaire Plan du site
Home > Research results > Research highlights
Research results
Research highlight : THE AVERAGE COMPLEXITY OF TREE ALIGNMENT
THE AVERAGE COMPLEXITY OF TREE ALIGNMENT
28 January 2008

We have proved that the average complexity of the pairwise ordered tree alignment algorithm of Jiang, Wang and Zhang is in O(nm), where n and m stand for the sizes of the two trees, respectively.
The same result holds for the average complexity of pairwise comparison of RNA secondary structures.

Reference:

Claire Herrbach , Alain Denise , Serge Dulucq, Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of a RNA secondary structure alignment algorithm, Proceedings of MACIS 2007.



Keyword
  ° Algorithms
  ° Bioinformatics
  ° Combinatory

Group
  ° Bioinformatics

Contact
  [none]
Research highlights
INFORMATION-GEOMETRIC OPTIMIZATION ALGORITHMS: A UNIFYING PICTURE VIA INVARIANCE PRINCIPLES
2 May 2017
Yann Ollivier, Ludovic Arnold, Anne Auger, Nikolaus Hansen - JMLR 18(18):1−65, 2017.

FORMAL MUTATION TESTING FOR CIRCUS
21 April 2016
Alex Donizeti Betez Alberto, Ana Cavalcanti, Marie-Claude Gaudel, Adenilso Simao Journal of Infor

CELL-CELL COMMUNICATION ENHANCES THE CAPACITY OF CELL ENSEMBLES TO SENSE SHALLOW GRADIENTS DURING MORPHOGENESIS
9 February 2016
D. Ellison, A. Mugler, M.D. Brennan, S.H. Lee, R.J. Huebner, E.R. Shamir, L.A. Woo, J. Kim, P. Amar

COMPUTING WITH SYNTHETIC PROTOCELLS
13 May 2015
Alexis Courbet, Franck Molina and Patrick Amar

ICDE 2015 TUTORIAL: RDF DATA MANAGEMENT: REASONING ON WEB DATA
27 October 2014