We present three quantum algorithms for clustering graphs based on higher-order patterns, known as motif clustering. One uses a straightforward application of Grover search, the other two make use approximate counting, and all them obtain square-root like speedups over fastest classical in various settings. In order to counting context clustering, we show that general weighted performance spect...

The fast-changing growth of new developments in a Malay Royal Town to create attractions with various forms architectural expressions has given direct impression on the street level, affecting survival buildings along heritage area. As result, it will tarnish original character place and disappear image. A deficit visual representation for injecting attachment through traditional plant motif sy...

We used a novel graph-based approach to identify recurrent RNA tertiary motifs embeddedwithin secondary structure. We catalogued all the secondary structural elements of the RNA molecule and clustered them using an innovative graph similarity measure. We applied our method to three widely studied structures: H.m 50S, E.coli 50S and T.th 16S. We identified 10 known motifs without any prior knowl...