### TABLE I ALL POSSIBLE CASES OF THE COEFFICIENTS

2002

Cited by 11

### TABLE I ALL POSSIBLE CASES OF THE COEFFICIENTS

2002

Cited by 11

### Table 3.1 All Possible Cases

in Developing Scheduling Algorithms to Access the Critical Section in Shared-Memory Parallel Computers

### Table 3. The possible cases in the completeness analysis.

### Table 3: 7 possible cases of a 3-point mutation.

2002

"... In PAGE 7: ... This means the minimum number of mutation points is 2 and the minimum number of linked node has to be i+1. Table3 shows 7 possible cases of a 3-point... ..."

Cited by 1

### Table 1: Possible cases for a terminal separator of size k

"... In PAGE 74: ...Table 1: Possible cases for a terminal separator of size k As the numbers in Table1 suggest, this method can be used profitably usually only for k 4 (and for k 3 only if the processed component is reasonably small). Actually, not all these cases must always be considered explicitly, because many of them can be ruled out at little extra cost using some heuristics.... ..."

### Table 3: All possible cases provided by tree topologies comparison tests

2005

"... In PAGE 8: ... Thus we get 6 data, from which an ED unit asks to expert system which fusion must be done in a consensus tree (Table 2). The knowledge to be modeled and the different possible cases are shown in Table3 and Table 4, and the corre- sponding PROLOG code is shown and commented on Appendix 1. Example 2: multiple alignment masking for sites not evolving under neutrality At step 2 of phylogenomic inference approaches, a multi- ple alignment of putative homologous sequences is produced.... ..."

### Table 5 summarizes the four possible cases for a given h

1997

"... In PAGE 12: ... By sym- metry, we need only to consider the Large-Left and the Large-Right case, and the Zero case. For the Large-Left case, according to Table5 , the skip route (Left) is always shorter... In PAGE 13: ... Proof: The algorithm enumerates all the possible alignments between s and d, including h s = h d . For each alignment, the only two possibilities regarding routes are the selected skip route and the non-skip route (both assumed to be using the optimal movementas given in Table5 ). The algorithm picks the one that apos;s shorter.... ..."