• DocumentCode
    2024802
  • Title

    Circular Rank Distance: A New Approach for Genomic Applications

  • Author

    Dinu, Liviu P. ; Ghetu, Florin

  • Author_Institution
    Fac. of Math. & Comput. Sci., Univ. of Bucharest, Bucharest, Romania
  • fYear
    2011
  • fDate
    Aug. 29 2011-Sept. 2 2011
  • Firstpage
    397
  • Lastpage
    401
  • Abstract
    The Rank Distance is a relatively new metric being used in genomic applications that has good potential, excellent computational properties and known limitations. This paper proposes a refinement to the standard Rank Distance in order to overcome some principal limitations of the metric for genetic applications. The paper first gives an introduction into the main concepts of the Rank Distance, then it explores its weaknesses for genetic applications. A new concept, the Circular Rank Distance, is proposed to address these weaknesses, and its properties, advantages and computational complexity are analyzed. The Circular Rank Distance is experimentally verified by being used to create a plausible phylogenetic tree. The paper ends with suggestions for further research.
  • Keywords
    bioinformatics; computational complexity; genetics; circular rank distance; computational complexity; computational property; genomic application; plausible phylogenetic tree; standard rank distance refinement; Bioinformatics; Complexity theory; DNA; Finite element methods; Genomics; Phylogeny; DNA similarities; rank distance;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Database and Expert Systems Applications (DEXA), 2011 22nd International Workshop on
  • Conference_Location
    Toulouse
  • ISSN
    1529-4188
  • Print_ISBN
    978-1-4577-0982-1
  • Type

    conf

  • DOI
    10.1109/DEXA.2011.20
  • Filename
    6059849