Christian Baudet, Zanoni Dias. An improved algorithm to enumerate all traces that sort a signed permutation by reversals. In Sung Y. Shin, Sascha Ossowski, Michael Schumacher, Mathew J. Palakal, Chih-Cheng Hung, editors, Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010. pages 1521-1525, ACM, 2010. [doi]
@inproceedings{BaudetD10, title = {An improved algorithm to enumerate all traces that sort a signed permutation by reversals}, author = {Christian Baudet and Zanoni Dias}, year = {2010}, doi = {10.1145/1774088.1774416}, url = {http://doi.acm.org/10.1145/1774088.1774416}, researchr = {https://researchr.org/publication/BaudetD10}, cites = {0}, citedby = {0}, pages = {1521-1525}, booktitle = {Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010}, editor = {Sung Y. Shin and Sascha Ossowski and Michael Schumacher and Mathew J. Palakal and Chih-Cheng Hung}, publisher = {ACM}, isbn = {978-1-60558-639-7}, }