AVERAGE COMPLEXITY OF THE JIANG-WANG-ZHANG PAIRWISE TREE ALIGNMENT ALGORITHM AND OF A RNA SECONDARY STRUCTURE ALIGNMENT ALGORITHM 1 June 2010 Claire Herrbach, Alain Denise and Serge Dulucq. Theoretical Computer Science 411 (2010) 2423-2432.
We prove 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. We show that the same result holds for the average complexity of RNA secondary structure alignment. Keyword   ° Algorithms   ° Bioinformatics   ° Combinatory Group   ° Bioinformatics Contact   ° DENISE Alain

HOW FAST CAN YOU CONVERGE TOWARDS A CONSENSUS VALUE?
28 October 2021
In their recent work, Matthias Fuegger (LMF), Thomas Nowak (LISN), and Manfred Schwarz (TU Wien) stu

MODEL TRANSFORMATION AS CONSERVATIVE THEORY-TRANSFORMATION
30 October 2020
We present a new technique to construct tool support for domain-specific languages (DSLs) inside the

BEST STUDENT PAPER AWARD (ML) AT ECML 2019
20 September 2019
Guillaume Doquet (A&O) received the Best Student Paper Award (category Machine Learning) at ECML 201

BEST PAPER AWARD - HPCS 2019 - ON SERVER-SIDE FILE ACCESS PATTERN MATCHING
17 July 2019
Francieli Zanon Boito¹ , Ramon Nou², Laércio Lima Pilla³, Jean Luca Bez⁴, Jean-François Méhaut¹, T

BEST FULL PAPER AWARD EDM 2019 - EDUCATIONAL DATA MINING
5 July 2019
DAS3H: Modeling Student Learning and Forgetting for Optimally Scheduling Distributed Practice of Ski