### Table 1. Number of table updates for three sets of human proteins. We compare full DP, full DP on the Sequence Matching Graph (SMG), and the actual number of table updates when considering only relevant directions; the SMG is generated using all significant gapped/un-gapped BLAST alignments. We see that in all cases, the actual work is several orders of magnitudes faster than the DP calculation.

"... In PAGE 6: ... We use gapped and un-gapped BLAST with E-value threshold of 10e- 2 to find local alignments. Table1 lists the number of table updates needed to find the optimal MSA for these alignments. The first column has the size of the full DP matrix, or the prod- uct of the sequences lengths (same for gapped and un- gapped).... In PAGE 7: ... The width of the nodes in the graph is proportional to the length of their cor- responding segments. Complete figures of the cases listed in Table1 , are available in the supplementary material1 in a format which allows zooming for ex- ploring the details. We see that there are many instances in which the rel- evant directions strategy is beneficial (e.... ..."

### Table 5. From entailment to unsatisfiability

2005

"... In PAGE 7: ... Since we used the OWL Lite reduction for individual axioms, we additionally need to reduce two more entailment axioms. The complete reduction is depicted in Table5... In PAGE 8: ... In fact, since fuzzy DLs are just a generalization of crisp DLs, this reduction also holds in the crisp case, if we consider degrees 0 and 1. As for the case of f-OWL Lite, which corresponds to the DL f-SHIF(D+), and does not support nominals, we can simply replace nominal concepts {y}, in Table5 , with a new concept B that does not appear elsewhere in the KB. 6 Querying the Fuzzy Semantic Web After building an ontology, with the aid of the OWL ontology language, it would feel natural to be able to perform complex queries, or retrieval tasks, over the ABox defined.... ..."

Cited by 16

### Table 3. Found justification statistics. Notice some very large justifications and some entailments with high numbers of justifications. In contrast, many ontologies had rel- atively small and few justifications.

### Table 3. Found justification statistics. Notice some very large justifications and some entailments with high numbers of justifications. In contrast, many ontologies had relatively small and few justi- fications.

### Table 3: Comparison Table of Assessment Methods

"... In PAGE 7: ... They were a reasonable alternative since they were already in place, but not relevant to direct measurement of student learning outcomes. A Comparison of Techniques Table3 summarizes the alternative techniques in terms of their correlation with outcomes, faculty workload, cost, and external validation of outcomes. The methods that correlated best ... ..."

### Table 1: Direct Rambus timings for Min -45 -800 part

"... In PAGE 3: ... \Memory cycles quot; refer to the 400 MHz interface clock. Table1 gives the relevant Direct RDRAM timing parameters used in our simulations. The RDRAM cores incorporate 16 banks in a \double bank quot; architecture, where adjacent banks share sense ampli ers.... ..."

### Table 5: Complexity of deciding entailment given the default rankings

2000

"... In PAGE 15: ... We remark that a similar BYC8C6C8 CZ algorithm is also feasible for DEB7, if the strengths ARB4CSB5 of defaults are bounded by a polynomial in the number of defaults. Table5 tells us that in all cases except DEB7, entailment does not become easier if the default ranking CA is known. Thus, from a worst case perspective, precomputing the default ranking CA does not pay off (but clearly saves time over repetitive computations).... ..."

Cited by 19

### Table 3: Complexity of deciding entailment given the default rankings

"... In PAGE 13: ... We remark that a similar BYC8C6C8 CZ algorithm is also feasible for DEB7, provided that the strengths ARB4CSB5 of defaults are not too big (in particular, if each ARB4CSB5 is bounded by a polynomial in the number of defaults). Table3 tells us that in all cases except DEB7, entailment does not become easier if the default ranking CA is known. Thus, from a worst case perspective, precomputing the default ranking CA does not pay off (but clearly saves time over repetitive computations).... ..."

### TABLE VIII CONTROLLER 2 DESIGNED FOR dl = O, dz = 5, d3 = 10,

1998

Cited by 34