Efficient algorithms for longest common subsequence of two bucket orders to speed up pairwise genetic map comparison

HIGHLIGHTS

• who: Lisa De Matt#_#x00E9 and colleagues from the University of Queensland, Brisbane, Australia, AGAP, Univ Montpellier, CIRAD, INRA, Montpellier have published the article: Efficient algorithms for Longest Common Subsequence of two bucket orders to speed up pairwise genetic map comparison, in the Journal: PLOS ONE | https://doi.org/10.1371/journal.pone [0208838]. December 27, 2018 of /1371/
• what: The authors propose to encode genetic maps by bucket order a kind of order which takes into account the blurred parts of the marker order while being an efficient structure to achieve low complexity . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.