Two shortest path metrics on well-formed parentheses strings
From MaRDI portal
Publication:286951
DOI10.1016/S0020-0190(96)00180-9zbMath1336.68187MaRDI QIDQ286951
F. Blanchet-Sadri, M. Dambrine
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items (5)
Chains with Small Intervals in the Lattice of Binary Paths ⋮ The pruning-grafting lattice of binary trees ⋮ Matchings In Three Catalan Lattices ⋮ The phagocyte lattice of Dyck words ⋮ A metric for rooted trees with unlabeled vertices based on nested parentheses
Cites Work
- A distance metric on binary trees using lattice-theoretic measures
- On the use of ordered sets in problems of comparison and consensus of classifications
- Enumerations of ordered trees
- Metrics on partially ordered sets - a survey
- On the structure of the lattice of noncrossing partitions
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- The number of coverings in four catalan lattices
- Generating binary trees by transpositions
- A Note on Generating Well-formed Parenthesis Strings Lexicographically
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- A note on generating binary trees inA-order andB-order
- Short Encodings of Evolving Structures
- Unnamed Item
This page was built for publication: Two shortest path metrics on well-formed parentheses strings
