The following publications are possibly variants of this publication:
- Proximity Search for Maximal Subgraph EnumerationAlessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari. SICOMP, 51(5):1580-1625, 2022. [doi]
- Polynomial-Delay Enumeration of Maximal Common SubsequencesAlessio Conte, Roberto Grossi, Giulia Punzi, Takeaki Uno. spire 2019: 189-202 [doi]
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequenceHiroki Arimura, Takeaki Uno. jco, 13(3):243-262, 2007. [doi]
- A Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a SequenceHiroki Arimura, Takeaki Uno. isaac 2005: 724-737 [doi]