"Perfect Sorting by Reversals Is Not Always Difficult."

Sèverine Bérard et al. (2007)

> Home

Details and statistics

DOI: 10.1109/TCBB.2007.1011

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  authority control:
- export record
  dblp key:
  - journals/tcbb/BerardBCP07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcbb/BerardBCP07
Sèverine Bérard, Anne Bergeron, Cédric Chauve, Christophe Paul:
Perfect Sorting by Reversals Is Not Always Difficult. IEEE ACM Trans. Comput. Biol. Bioinform. 4(1): 4-16 (2007)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.