a aa ab ac ad ae af ag ah ai aj ak al am an ao ap aq ar as at au av aw ax ay az

Перевод: acyclic

[прилагательное]
нецикличный; ациклический; непериодический

Тезаурус:

1. The Thai medicinal plant Croton sublyratus , which is used in traditional medicine, has recently been found to contain the antiulcer acyclic terpenoid plaunotol ( 17 ) which is similar in structure to gefarnate.
2. This structure is actually a graph rather than a tree, and is known as a Directed Acyclic Word Graph (dawg).
3. This graph of vertices and edges is acyclic and directed.
4. Details and results of comparisons between some implemented data structures were presented, and some methods of memory reduction such as tail-end compression and the use of a directed acyclic word graph were discussed.
5. Directed acyclic word graphs
6. It was concerned almost exclusively with acyclic "functionally simple" compounds ie acyclic compounds with only one type of functional group.
7. Eight acyclic terpenes have been found in the plant which may have antiulcer activity.
8. Factors taken into consideration are, in decreasing order of priority: minimisation of the number of free valences of the CRU; maximisation of the number of most preferred heteroatoms in the ring system; retaining the most preferred ring system; and choosing the longest chain for an acyclic CRU.
9. However it does mean that the additional information can be removed from the look-up tree, which in turn means that a compression method can now be applied to the tree, such as utilising a directed acyclic word graph (section 3.2.5 and section 3.3.3).
10. Several types of tree structures were implemented for comparison: a binary tree (section 3.2.2), a 26-way tree (section 3.2.3.2), a reduced memory tree (section 3.3.1), two linked list mixed-method trees (section 3.3.2), one using the 26-way tree structure, and the other using the reduced memory structure, a binary trie (section 3.2.3.3) and a directed acyclic word graph (section 3.2.5).
11. The directed acyclic word graph (section 3.2.5 and section 3.3.3) is the optimal structure for saving memory, but no additional information can be stored for each word.