192 search results - page 21 / 39 » Genome rearrangements with duplications |
WABI
2005
Springer
15 years 3 months ago
2005
Springer
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Recently, several studies taking into account the ability for a gene to be absent or to have some copies in genomes have been proposed, as the examplar distance [11, 6] or the gene...
WABI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Traditional sequence comparison by alignment applies a mutation model comprising two events, substitutions and indels (insertions or deletions) of single positions (SI). ...
BIOCOMP
2007
14 years 11 months ago
2007
Reconstructing phylogenies is one of the primary objectives in evolution studies. Efficient software to reconstruct phylogenies based on isolated genes has existed for decades, ye...
BIBE
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—Because of the advent of high-throughput sequencing and the consequent reduction in cost of sequencing, many organisms have been completely sequenced and most of their g...