sign in
english version rss feed

inria-00180004, version 1

Mapping sequences by parts

Gilles Didier a1, Carito Guziolowski () b2

Algorithms for Molecular Biology 2 (2007) 11

Abstract: We present the N-map method, a pairwise and asymmetrical approach which allows us to compare sequences by taking into account evolutionary events that produce shuffled, reversed or repeated elements. Basically, the optimal N-map of a sequence s over a sequence t is the best way of partitioning the first sequence into N parts and placing them, possibly complementary reversed, over the second sequence in order to maximize the sum of their gapless alignment scores.

  • Domain : Computer Science/Bioinformatics
 
  • inria-00180004, version 1
  • oai:hal.inria.fr:inria-00180004
  • From: 
  • Submitted on: Wednesday, 17 October 2007 14:11:46
  • Updated on: Friday, 19 October 2007 10:29:07
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...