Considering Adelman's Shortest Permutation Strings
Hesam Dashti
TL;DR
This paper analyzes Adelman's algorithm for generating shortest permutation strings, introducing a new representation that uncovers properties of the algorithm to improve understanding and potential applications.
Contribution
The paper presents a novel representation of Adelman's algorithm, revealing new properties and insights into shortest permutation string generation.
Findings
New representation of Adelman's algorithm
Identification of properties of shortest permutation strings
Enhanced understanding of permutation string generation
Abstract
In this report, we consider Adelman's algorithm for generating shortest permutation strings. We introduce a new representation approach which reveals some properties of Adelman's algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · semigroups and automata theory · Genome Rearrangement Algorithms