Shortcuts, diversions, and maximal chains in partially ordered sets
From MaRDI portal
Publication:2559393
DOI10.1016/S0012-365X(73)80007-XzbMath0258.06003OpenAlexW2090598620MaRDI QIDQ2559393
David Sankoff, Peter H. Sellers
Publication date: 1973
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(73)80007-x
Partial orders, general (06A06) Extremal problems in graph theory (05C35) Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20)
Related Items
A survey of multiple sequence comparison methods, General methods of sequence comparison, RNA secondary structures and their prediction, A fast and practical bit-vector algorithm for the longest common subsequence problem
Cites Work
- Matching Sequences under Deletion/Insertion Constraints
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- Unnamed Item
