"The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in ..."

Jesun Sahariar Firoz et al. (2011)

> Home

Details and statistics

DOI: 10.1089/CMB.2010.0042

access: closed

type: Journal Article

metadata version: 2020-03-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jcb/FirozHKR11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcb/FirozHKR11
Jesun Sahariar Firoz, Masud Hasan, Ashik Zinnat Khan, M. Sohel Rahman:
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(n log n) Time. J. Comput. Biol. 18(8): 1007-1011 (2011)

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.