Name
Abstract | ||
|---|---|---|
Classical approaches to compute the genomic distance are usually limited to genomes with the same content and take into consideration only rearrangements that change the organization of the genome (i.e. positions and orientation of pieces of DNA, number and type of chromosomes, etc.), such as inversions, translocations, fusions and fissions. These operations are generically represented by the double-cut and join (DCJ) operation. The distance between two genomes, in terms of number of DCJ operations, can be computed in linear time. In order to handle genomes with distinct contents, also insertions and deletions of fragments of DNA – named indels – must be allowed. More powerful than an indel is a substitution of a fragment of DNA by another fragment of DNA. Indels and substitutions are called content-modifying operations. It has been shown that both the DCJ-indel and the DCJ-substitution distances can also be computed in linear time, assuming that the same cost is assigned to any DCJ or content-modifying operation. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1186/1748-7188-8-21 | Algorithms for Molecular Biology |
Keywords | Field | DocType |
Double cut and join (DCJ), Insertions and deletions (indels), Substitution, Genome rearrangements, Genomic distance, Evolution, Comparative genomics, Combinatorics, Algorithms | Genome,Triangle inequality,Bioinformatics,Time complexity,Mathematics,Indel,Bounded function | Journal |
Volume | Issue | ISSN |
8 | 1 | 1748-7188 |
Citations | PageRank | References |
4 | 0.43 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Poly H. da Silva | 1 | 16 | 1.66 |
| Raphael Machado | 2 | 41 | 2.53 |
| Simone Dantas | 3 | 119 | 24.99 |
| Marília D. V. Braga | 4 | 203 | 17.00 |