Efficient algorithms for multichromosomal genome rearrangements. (Q1872727): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4252743 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Transforming cabbage into turnip / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4526776 / rank | |||
Normal rank | |||
Revision as of 16:25, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for multichromosomal genome rearrangements. |
scientific article |
Statements
Efficient algorithms for multichromosomal genome rearrangements. (English)
0 references
14 May 2003
0 references
Genome rearrangements
0 references
Fusion
0 references
Fission
0 references
Translocation
0 references
Reversal
0 references
Inversion
0 references
Breakpoint graph
0 references
Genes
0 references
Chromosomes
0 references
Homology
0 references
0 references
