Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Some simple varietie ...
Conference paper

Some simple varieties of trees arising in permutation analysis

Mathilde Bouvel (1), Marni Mishna (2), Cyril Nicaud ORCID (3)
(1) Laboratoire Bordelais de Recherche en Informatique
(2) Department of Mathematics [Burnaby]
(3) Laboratoire d'Informatique Gaspard-Monge
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2012
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Proceedings
DOI
10.46298/dmtcs.2346
License
https://about.hal.science/hal-authorisation-v1
Natural Sciences and Engineering Research Council of Canada
Indicators
781
Views
795
Downloads

Some simple varieties of trees arising in permutation analysis

Mathilde Bouvel (1), Marni Mishna (2), Cyril Nicaud ORCID (3)
(1) Laboratoire Bordelais de Recherche en Informatique
(2) Department of Mathematics [Burnaby]
(3) Laboratoire d'Informatique Gaspard-Monge
Abstract
English
After extending classical results on simple varieties of trees to trees counted by their number of leaves, we describe a filtration of the set of permutations based on their strong interval trees. For each subclass we provide asymptotic formulas for number of trees (by leaves), average number of nodes of fixed arity, average subtree size sum, and average number of internal nodes. The filtration is motivated by genome comparison of related species.
French
Nous commençons par étendre les résultats classiques sur les variétés simples d'arbres aux arbres comptés selon leur nombre de feuilles, puis nous décrivons une filtration de l'ensemble des permutations qui repose sur leurs arbres des intervalles communs. Pour toute sous-classe, nous donnons des formules asymptotiques pour le nombre d'arbres (comptés selon les feuilles), le nombre moyen de nœuds d'arité fixée, la moyenne de la somme des tailles des sous-arbres, et le nombre moyen de nœuds internes. Cette filtration est motivée par des problématiques de comparaison de génomes.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • permutations
  • simple varieties of trees
  • random generation
  • tree parameters
  • asymptotic formulas
Preview
Loading PDF preview...