Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Tabassum, Afrida"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    An improved chromosome sorting algorithm by permutation group-based inverted block-interchanges
    (© 2016 IEEE, 2016-12) Tabassum, Afrida; Abdullah, Wali Mohammad; Manjur, Najia; Islam, Rehennuma; Ahmed, Ashfaque Uddin; Morshed, Shourav Imtiaz; Tinni, Rizia Iqbal; Kabir, Kazi Lutful; Islam, Muhammad Nazrul
    In comparative genomics, a common issue is to find the shortest course of operations for the transformation of one genome into another. During rejoining the blocks, inverted block interchange, a more distinct form of block interchange, gives the option to the blocks to reverse their orientation. In this particular paper, we have presented an improved algorithm to sort circular chromosomes by inverted block interchanges and also compared the performances with a previous algorithm. Our experimental findings justify the fact that accommodation of inverted block interchange ensures results with equal or less number of series of operations in terms of block interchanges.
  • No Thumbnail Available
    Item
    An improved chromosome sorting algorithm by permutation group-based inverted block-interchanges
    (© 2016 IEEE, 2016-12) Tabassum, Afrida; Abdullah, Wali Mohammad; Manjur, Najia; Islam, Rehennuma; Ahmed, Ashfaque Uddin; Morshed, Shourav Imtiaz; Tinni, Rizia Iqbal; Kabir, Kazi Lutful; Islam, Muhammad Nazrul
    In comparative genomics, a common issue is to find the shortest course of operations for the transformation of one genome into another. During rejoining the blocks, inverted block interchange, a more distinct form of block interchange, gives the option to the blocks to reverse their orientation. In this particular paper, we have presented an improved algorithm to sort circular chromosomes by inverted block interchanges and also compared the performances with a previous algorithm. Our experimental findings justify the fact that accommodation of inverted block interchange ensures results with equal or less number of series of operations in terms of block interchanges.

© Open Research Bangladesh

  • Privacy policy
  • End User Agreement
  • Send Feedback