|
|
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]
|
| |
|
|
|
|
