"An (18/11)n upper bound for sorting by prefix reversals."

Bhadrachalam Chitturi et al. (2009)

Details and statistics

DOI: 10.1016/J.TCS.2008.04.045

access: open

type: Journal Article

metadata version: 2022-02-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics