70 search results - page 3 / 14 » Improving the analyses of nestedness for large sets of matri... |
BMCBI
2008
13 years 7 months ago
2008
Background: Modern sequencing technologies allow rapid sequencing and bioinformatic analysis of genomes and metagenomes. With every new sequencing project a vast number of new pro...
GBRPR
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
WABI
2009
Springer
14 years 1 months ago
2009
Springer
Background: Supertree methods comprise one approach to reconstructing large molecular phylogenies given multi-marker datasets: trees are estimated on each marker and then combined...
EUROPAR
2003
Springer
14 years 16 days ago
2003
Springer
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
JSAC
2006
13 years 7 months ago
2006
The responsiveness of networked applications is limited by communications delays, making network distance an important parameter in optimizing the choice of communications peers. S...