De Bruijn graphs
Análisis topológico de De Bruijn Graphs generados a partir de datos metagenómicos
... De Bruijn Graphs generados a partir de datos metagenómicos de la Titulación de Sistemas Informáticos y Computación, siendo Guido Eduardo Riofrío Calderón director del presente trabajo; y eximo expresamente ...
109
Comparative Analysis of de Bruijn Graph Parallel Genome Assemblers
... Comparative Analysis of de Bruijn Graph Parallel Genome Assemblers Introduction Genome Assemblers and De Bruijn Graphs Experimental Results and Analysis Conclusions and Future Work Comparative Analysi[.] ...
18
Comparative Analysis of de Bruijn Graph Parallel Genome Assemblers
... Velvet is a short read assembler that implements the de Bruijn graphs efficiently. Using two techniques called manipulation and compression, to joining into single nodes those paths that never cross each ...
8
Exponential families of minimally non coordinated graphs
... coordinated graphs were characterized by minimal forbidden induced subgraphs within some classes of ...non-coordinated graphs whose cardinality grows exponentially on the number of vertices and ...
11
Paths on graphs and associated quantum groupoids
... Some interesting further research arise in relation to this work. The represen- tation theory of these weak *-Hopf algebras has not been considered in this work. The detailed study of all the affine graphs(β = 2) ...
24
Some results on spectral distances of graphs
... From Proposition 3.1 we can see that if the multiplicities of the common eigen- value λ in the spectra of graphs whose partial spectral distance we compute are the same, then the reduced partial realization does ...
23
On the k partition dimension of graphs
... The paper is structured as follows. In Section 2 the main concepts are introduced while Section 3 is devoted to the problem of finding the largest integer k for which there exists a k-partition generator of G. ...
19
Metodologa de los grficos de unin (bond graphs) en aplicaciones biomdicas
... Este espectro tan diverso es posible gracias a que se han formulado varios métodos de modelado, ya sea matemáticos (funciones de transferencia, ecuaciones de estado) o gráficos como di[r] ...
20
Mapping Dynamics into Graphs. The Visibility Algorithm
... the graphs generated when the horizontal visibility (HV) algorithm [8–10] is applied to the trajectories of the universality class of unimodal maps, as represented by the quadratic logistic ...
108
Feigenbaum graphs at the onset of chaos
... In agreement with the known dynamics of unimodal maps at the transition to chaos the graph-theoretical Lyapunov exponent vanishes, and proceed to define generalized exponents that tak[r] ...
5
Quasiperiodic graphs at the onset of chaos
... the graphs associated with the corresponding rational fractions p/q taken as dressed winding numbers ω in the circle map (for space reasons only two of these are shown at the sixth ...
8
On the total k-domination in graphs
... The above lemma and the following theorem are very useful in order to find a minimum total k-dominating set in some particular graphs. If the graph has order n and contains a vertex v whose degree is equal to n − ...
17
On spectra of weighted graphs of order ≤5
... The problem of characterizing the real spectra of weighted graphs is only solved for weighted graphs of order n ≤ 4. We overview these known results, that come from the context of nonnegative matrices, and ...
6
Quasiperiodic Graphs: Structural Design, Scaling and Entropic Properties
... the graphs generated when the Horizontal Visibility (HV) al- gorithm [6, 7] is applied to the stationary trajectories of the universality class of low-dimensional nonlinear iter- ated maps with a cubic inflexion ...
5
An evaluation of best compromise search in graphs
... In this paper, we compare two different heuristic algorithmic strategies for best com- promise search in multiobjective graphs. The first one is a two-step procedure based on standard Pareto search algorithms, ...
10
TítuloAnalysis and evaluation of MapReduce solutions on an HPC cluster
... Figures 5a and 5b show execution times for the TeraSort benchmark using magnetic and SSD disks. The TeraSort benchmark has a higher disk / network activity than Wordcount and, as can be seen in the graphs, it is ...
25
Chilean children’s reading levels of statistical graphs
... The interest in the levels that children can achieve when reading a graph started with the work by Curcio (1981), who studies the relationship of various variables on the understanding of statistical graphs, among ...
12
Anonymizing Graphs: Measuring Quality for Clustering
... One widely adopted strategy of graph modification approaches is randomization. Randomization methods are based on adding random noise in original data. It has been well investigated for relational data. To work with ...
25
TítuloAnalysis of I/O Performance on an Amazon EC2 Cluster Compute and High I/O Platform
... right graphs of Figure 5 present the results for the write operation, where CC2 clearly outperforms CC1 instance type again, doubling the performance in some ...
22
Critical ideals of graphs
... For the past thirty years several authors studied critical groups from different perspectives but, among the published works theres been a lack of general results about the behavior of critical groups over general ...
86