Fast median computation for symmetric, orthogonal matrices under the rank distance
Explore this paper's citation graph
Summary
A novel scheme is proposed that works for symmetric orthogonal matrices, and produces a median, also guaranteed to be symmetric, in O ( n ω ) time.
- Type
- article
- Published
- 2020-11-04
- Cited by
- 1
- References
- 19
- OpenAlex
- https://openalex.org/W3096148602
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:228878440
Keywords
Mathematics, Combinatorics, Rank (graph theory), Context (archaeology), Matrix (chemical analysis)
References
- Linear Algebra Done Right
- Lengths of chromosomal segments conserved since divergence of man and mouse.
- Genome rearrangements in mammalian evolution: lessons from human and mouse genomes.
- Plant mitochondrial DNA evolved rapidly in structure, but slowly in sequence
- A New Genomic Evolutionary Model for Rearrangements, Duplications, and Losses that Applies across Eukaryotes and Prokaryotes
- The neighbor-joining method: a new method for reconstructing phylogenetic trees.
- Median Approximations for Genomes Modeled as Matrices
- On the rank-distance median of 3 permutations
- Genome rearrangements in Escherichia coli during de novo acquisition of resistance to a single antibiotic or two antibiotics successively
- Genome rearrangements and selection in multi-chromosome bacteria Burkholderia spp.
- Large-scale mammalian genome rearrangements coincide with chromatin interactions
- A general framework for genome rearrangement with biological constraints
- A cubic algorithm for the generalized rank median of three genomes
- Counting Sorting Scenarios and Intermediate Genomes for the Rank Distance
- A Practical Algorithm for Ancestral Rearrangement Reconstruction
- Genomic Rearrangements and Evolution
- Generalizations of the Genomic Rank Distance to Indels
- Wavelets
Cited by
Related papers
- Quivers of 3 × 3-exponent matrices
- Some rank equalities of some outer inverses of the same matrix
- Generalization of real interval matrices to other fields
- Existence of a low rank or ℋ︁‐matrix approximant to the solution of a Sylvester equation
- An Efficient Method of Matrix Multiplication for Heaps of Pieces
- AutoTSMM: An Auto-tuning Framework for Building High-Performance Tall-and-Skinny Matrix-Matrix Multiplication on CPUs
- Implementation of the Spark technique in a matrix distributed computing algorithm