scientific article; zbMATH DE number 910919
From MaRDI portal
zbMATH Open0846.92019MaRDI QIDQ4886096FDOQ4886096
Authors: R. Ravi, John D. Kececioglu 
Publication date: 22 August 1996
Title of this publication is not available (Why is that?)
Recommendations
inversionoptimal algorithmcombinatorial algorithmstranslocationgenome rearrangements2-approximation algorithmrearrangement distancetranslocation distance
Biochemistry, molecular biology (92C40) Problems related to evolution (92D15) Parallel algorithms in computer science (68W10)
Cited In (27)
- Polynomial-time algorithm for computing translocation distance between genomes
- Efficient algorithms for multichromosomal genome rearrangements.
- Reconstructing an ancestral genome using minimum segments duplications and reversals.
- Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
- On the complexity of unsigned translocation distance
- Probabilistic models of genome shuffling
- Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?
- Sorting permutations by block-interchanges
- Comparative Genomics
- Genome rearrangements with partially ordered chromosomes
- On the complexity and approximation of syntenic distance
- Combinatorial Pattern Matching
- Position and content paradigms in genome rearrangements: the wild and crazy world of permutations in genomics
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS
- Transposition rearrangement: linear algorithm for length-cost model
- Reconstructing a history of recombinations from a set of sequences
- A factor-\((1.408+\varepsilon)\) approximation for sorting unsigned genomes by reciprocal translocations
- Using ciliate operations to construct chromosome phylogenies
- Title not available (Why is that?)
- Exact and approximation algorithms for the contiguous translocation distance problem
- A 1.375-approximation algorithm for unsigned translocation sorting
- Research in Computational Molecular Biology
- An \(O(n^{3/2}\sqrt {\log (n)})\) algorithm for sorting by reciprocal translocations
- Can a breakpoint graph be decomposed into none other than 2-cycles?
- Nonoverlapping local alignments (weighted independent sets of axis parallel rectangles)
- Sorting genomes by generalized translocations
- A 1.75-approximation algorithm for unsigned translocation distance
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4886096)
