49 search results - page 7 / 10 » Genome Rearrangements and Sorting by Reversals |
BMCBI
2007
13 years 7 months ago
2007
Background: Identifying syntenic regions, i.e., blocks of genes or other markers with evolutionary conserved order, and quantifying evolutionary relatedness between genomes in ter...
BMCBI
2006
13 years 7 months ago
2006
Background: Analysis of genomes evolving via block-interchange events leads to a combinatorial problem of sorting by block-interchanges, which has been studied recently to evaluat...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
Genomic maps often do not specify the order within some groups of two or more markers. The synthesis of a master map from several sources introduces additional order ambiguity due ...
JCB
2002
13 years 7 months ago
2002
One possible model to study genome evolution is to represent genomes as permutations of genes and compute distances based on the minimum number of certain operations (rearrangemen...
ISAAC
2004
Springer
14 years 25 days ago
2004
Springer
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...