18 search results - page 4 / 4 » Efficient algorithms for multichromosomal genome rearrangeme... |
RECOMB
2007
Springer
14 years 5 months ago
2007
Springer
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
ALMOB
2008
13 years 4 months ago
2008
The increasing throughput of sequencing raises growing needs for methods of sequence analysis and comparison on a genomic scale, notably, in connection with phylogenetic tree reco...
BMCBI
2010
13 years 4 months ago
2010
Background: Conserved gene clusters are groups of genes that are located close to one another in the genomes of several species. They tend to code for proteins that have a functio...