Sciweavers

49 search results - page 3 / 10
» Genome Rearrangements and Sorting by Reversals
Sort
View
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
13 years 11 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
CIBCB
2005
IEEE
14 years 1 months ago
Heuristic Algorithm for Computing Reversal Distance with MultiGene Families via Binary Integer Programming
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
Jakkarin Suksawatchon, Chidchanok Lursinsap, Mikae...
JCB
2008
144views more  JCB 2008»
13 years 7 months ago
Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
Max A. Alekseyev
JCB
2008
111views more  JCB 2008»
13 years 7 months ago
Sorting Genomes with Centromeres by Translocations
A centromere is a special region in the chromosome that plays a vital role during cell division. Every new chromosome created by a genome rearrangement event must have a centromer...
Michal Ozery-Flato, Ron Shamir
RECOMB
2007
Springer
14 years 7 months ago
Multi-break Rearrangements: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2break rearrangements represent standard reversals, fusions, ...
Max A. Alekseyev