Constant time and space updates for the sigma-tau problem
From MaRDI portal
Publication:6545441
DOI10.1007/978-3-031-43980-3_26MaRDI QIDQ6545441FDOQ6545441
Zsuzsanna Lipták, Aaron Williams, Francesco Masillo, Gonzalo Navarro
Publication date: 29 May 2024
permutationsdynamic data structurescombinatorial generationcombinatorial Gray codessigma-tau problem
Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Data structures (68P05)
Cites Work
- Title not available (Why is that?)
- Indexing compressed text
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Title not available (Why is that?)
- Combinatorics of genome rearrangements.
- Title not available (Why is that?)
- A Survey of Combinatorial Gray Codes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Sorting by Transpositions
- Faster entropy-bounded compressed suffix trees
- Succinct representations of permutations and functions
- Title not available (Why is that?)
- Shorthand universal cycles for permutations
- An explicit universal cycle for the ( n -1)-permutations of an n -set
- Faster algorithms for sorting by transpositions and sorting by block interchanges
- Title not available (Why is that?)
- The coolest way to generate combinations
- Genome Rearrangements and Sorting by Reversals
- Title not available (Why is that?)
- A simpler and faster 1.5-approximation algorithm for sorting by transpositions
- Combinatorial Gray codes -- an updated survey
- Title not available (Why is that?)
- Permutation patterns in genome rearrangement problems: the reversal model
- Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
- Doubly adjacent gray codes for the symmetric group
- Containing All Permutations
- Title not available (Why is that?)
- r-indexing the eBWT
- Solving the Sigma-Tau Problem
- A Simple Proof of Rankin's Campanological Theorem
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
- Syntactic view of sigma-tau generation of permutations
Cited In (2)
This page was built for publication: Constant time and space updates for the sigma-tau problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545441)