English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

An effective indexing scheme for clusters that enables fast structurecomparison and congruence check is desperately desirable in the field ofmathematics, artificial intelligence, materials science, etc. Here we introducethe concept of minimum vertex-type sequence for the indexing of clusters onsquare lattice, which contains a series of integers each labeling the vertextype of an atom. The minimum vertex-type sequence is orientation independent,and it builds a one-to-one correspondence with the cluster. By using minimumvertex-type sequence for structural comparison and congruence check, only onetype of data is involved, and the largest amount of data to be compared is npairs, n is the cluster size. In comparison with traditional coordinate-basedmethods and distance-matrix methods, the minimum vertex-type sequence indexingscheme has many other remarkable advantages. Furthermore, this indexing schemecan be easily generalized to clusters on other high-symmetry lattices. Our workcan facilitate cluster indexing and searching in various situations, it mayinspire the search of other practical indexing schemes for handling clusters oflarge sizes.

Minimum Vertex-type Sequence Indexingfor Clusters on Square Lattice