Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference10 articles.
1. Sorting by insertion of leading elements;Aigner;J. Combin. Theory Ser. A,1987
2. Sorting by transpositions;Bafna,1995
3. Genome rearrangements and sorting by reversals;Bafna;SIAM J. Comput.,1996
4. Sorting by reversals is difficult;Caprara,1996
5. The minimum-length generator sequence problem is NP-hard;Even;J. Algorithms,1981
Cited by
112 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Rearrangement Distance Problems: An updated survey;ACM Computing Surveys;2024-04-26
2. Contextual Matrix Orderings for Graph Collections;2024 IEEE 17th Pacific Visualization Conference (PacificVis);2024-04-23
3. Flanked Block-Interchange Distance on Strings;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2024-03
4. Genome Rearrangement Analysis;Methods in Molecular Biology;2024
5. Sorting by prefix block-interchanges;Theoretical Computer Science;2023-05