Taxator-tk: Fast and Precise Taxonomic ... - Semantic Scholar

an algorithm and the accompanying software, taxator-tk, which performs taxonomic sequence assignments by fast .... without the computationally demandi...

1 downloads 13 Views 6MB Size

Recommend Documents

Another thing to keep in mind is that cosmogenic neutrinos are signatures of hadronic .... survive deployment and freeze-in completely; another 1% are impaired, but usable (usually, they have lost their local coincidence ...... One of the most import

Jul 23, 2010 - Abstract—As more and more multi-tier services are developed from commercial off-the-shelf components or heterogeneous middleware without source code available, both developers and administrators need a request tracing tool to (1) exa

Jul 11, 2016 - Setup and operation protocol of the platform is described in detail in .... FD and CB were supplied in square waves (300 s out of sync) to the left. (FD) and right (CB) channels (Fig. ..... tally.36 To calculate the diffusion coefficie

Jan 27, 2016 - Another challenge is to incorporate the increasing amount of epidemiologically relevant data into the models [5]. It is therefore desirable to have simulation tools that are flexible to various disease spread models yet efficient to ha

Aug 10, 2017 - Vector space models excel at determining similarity between concepts, but they are severely ... an end-to-end pipeline grounded in the cybersecurity informatics domain. KEYWORDS. Knowledge Representation ... It involves designing compu

Abstract—Given a dataset, the task of learning a transform that allows sparse representations of the data bears the name of dictionary learning. In many applications, these learned dictionaries represent the data much better than the static well-kn

Feb 19, 2017 - to demystify the constitution of a graph embedding algorithm and analyze the function of each building block. In what follows, we discuss each ...... abs/1610.09950, 2016. [26] S. Brin and L. Page, “The anatomy of a large-scale hyper

Aug 20, 2010 - l=1 Nl. Proposition 3: M = ∪g l=1Ml contains full-rank, R- linearly independent matrices which satisfy. BH. 1 B2 + BH. 2 B1 = 0 for B1 ∈ Ml1 ,B2 ∈ Ml2 , for 1 ≤ l1 < l2 ≤ g. Proof: The fact that ...... [9] Zafar Ali Khan Md.,

The detailed analysis of the membrane formation ... figure 6. The increase in radius of the travelling contact lines is very fast ~1 mm/s and linear in time (∆ ~∆ 1,1) for all tested lipids. ... represented by three dielectrics in series (lipid

Jan 27, 2016 - is animal trade, creating a temporal network of contacts between farms [10]. It has been shown that the ... crete Event simulation (DES), a general approach to evolve dynamical systems consisting of discrete ... as all the necessary in

Dec 27, 2016 - University of Padua, IT [email protected], [email protected] †. University of Oxford, UK ... within six seconds (90% within four seconds) after they leave their workstation's vicinity. .... for device free localiz

Mar 17, 2015 - 2 Overview of Established Algorithms. 4. 2.1 Representation of ..... However, Fürer conjectured that his new method only becomes faster than Schönhage and. Strassen's algorithm for .... Lastly, Chapter 5 sums up the results and shows

Mar 17, 2015 - choices here: either use a word type that is only half the processor word size, so the product can be stored in a full processor word, or use some special function to get both the high and low part of a full sized multiplication in two

Jun 23, 2016 - Abstract. There is an urgent need for compact, fast, and power-efficient hardware implementa- tions of state-of-the-art artificial intelligence. Here we propose a power-efficient approach for real-time inference, in which deep neural n

Aug 9, 2010 - cessed to create an oracle that can answer (2k − 1)-approximate distance queries between any two vertices .... 2O(λ)nlog2 n time and answers (1 + ε)-approximate distance queries in 2O(λ) time. .... we define a parent-child relation

Research Questions. The objective of this study is to introduce, access and compare two new methods for national research impact indicators and to assess them for individual subjects. ... Electrochemistry; Computational Theory and Mathematics; Manage

Feb 18, 2017 - 2 . Y. Aharonov and Bohm [1] gave an example in which the principle doesn't hold; whereas Aharonov, Massar and ... and Bohm [1] noticed that the measurement duration ∆t can be reduced arbitrarily if an amplified ...... [62] David A H

Aug 30, 2017 - Next, we illustrate this system via a series of examples (Figure 1). Higher-order ...... Thus, we use a different mechanism for sharing results: a large hashtable mapped to RAM, ..... Satish Chandra, Colin S. Gordon, Jean-Baptiste Jean

estimation using the Fast Fourier Transform procedure and maximum decay sidelobes windows. The most ... Keywords: control of power, grid signal, amplitude and phase estimation, renewable energy, interpolated DFT, maximum ... under/over voltage protec

Dec 17, 2016 - e.g., [24]).6 Our personal communication in 2015 with the authors of [50] seems to help: the label ... of fast MM directed to minimizing communication cost and improving parallel implementation. The ...... though never serious for fast

Jan 16, 2012 - objective function – schedulers such as those based on utility maximization, maximum weight ... We first consider a channel model where the channel gain in the frequency domain is flat and formulate the resource allocation problem as

of success in your professional and personal endeavours. I would like to thank the subjects ... PERCLOS and SR are two ocular parameters reported to be measures of alertness levels in human beings. ...... is a weighted linear combination of these

These steps can take days to perform manually, and are error prone. Our investigation of a few fMRI applications indicate that such ad hoc scripts often require ... Since manual bookkeeping of the process and tracking of ...... Clustering/Partitionin

challenge arises because accurate computation of the relative frequencies of different motifs requires enumeration ... Given a large graph G, the problem considered in this paper is one of determining C(k, m) for any k and m by .... algorithm achieve