Pages that link to "Item:Q286951"
From MaRDI portal
The following pages link to Two shortest path metrics on well-formed parentheses strings (Q286951):
Displaying 6 items.
- A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
- Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246) (← links)
- The phagocyte lattice of Dyck words (Q862973) (← links)
- The pruning-grafting lattice of binary trees (Q2378517) (← links)
- Matchings In Three Catalan Lattices (Q4805933) (← links)
- Chains with Small Intervals in the Lattice of Binary Paths (Q5212152) (← links)