The syntenic diameter of the space of N-chromosome genomes
From MaRDI portal
Publication:5457090
zbMATH Open1137.92356MaRDI QIDQ5457090FDOQ5457090
Authors: David Liben-Nowell, Jon M. Kleinberg 
Publication date: 14 April 2008
Recommendations
- On maximal instances for the original syntenic distance
- Gossip is synteny: Incomplete gossip and the syntenic distance between genomes
- Gossip is synteny: Incomplete gossip and an exact algorithm for syntenic distance
- Genome Rearrangements and Sorting by Reversals
- Further thoughts on the syntenic distance between genomes
Cited In (13)
- Size of the whole versus number of parts in genomes
- A generalized approach for social network integration and analysis with privacy preservation
- A metric on directed graphs and Markov chains based on hitting probabilities
- Improved link prediction using PCA
- Gossip is synteny: Incomplete gossip and the syntenic distance between genomes
- Random walk with restart: fast solutions and applications
- Strong simulation
- Nonparametric link prediction in large scale dynamic networks
- Gossip is synteny: Incomplete gossip and an exact algorithm for syntenic distance
- Role of normalization in spectral clustering for stochastic blockmodels
- Optimal algorithms for uncovering synteny problem
- Relational retrieval using a combination of path-constrained random walks
- On maximal instances for the original syntenic distance
This page was built for publication: The syntenic diameter of the space of \(N\)-chromosome genomes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5457090)
