Results 281 to 290 of about 143,594 (316)

HGCPep: Hypergraph Deep Learning Identifies Cancer-associated Non-coding Peptides. [PDF]

Genomics Proteomics Bioinformatics
Long W, Li Z, Jin J, Qiao J, Wang Y, Wei L.   +5 more
europepmc   +1 more source

Isomorphism classes of Drinfeld modules over finite fields

Valentijn Karemaker, Jeffrey Katen, Mihran Papikian   +2 more
openalex   +1 more source

Prediction of circRNA-Disease Associations via Graph Isomorphism Transformer and Dual-Stream Neural Predictor. [PDF]

Biomolecules
Li H, Qian Y, Sun Z, Zhu H.
europepmc   +1 more source

Transcendental Brauer-Manin obstructions on singular K3 surfaces. [PDF]

Res Number Theory
Alaa Tawfik M, Newton R.
europepmc   +1 more source

An example of one-dimensional Cohen-Macaulay local rings that posses only finitely many isomorphism classes of indecomposable maximal Buchsbaum modules

, 1987
Shirô Gotô
openalex   +1 more source

Automated Annotation of Sites of Metabolism from Biotransformation Data. [PDF]

J Chem Inf Model
Jacob RA, Mazzolari A, Kirchmair J.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On a class of isomorphic NFSRs

Designs, Codes and Cryptography, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiao-Xin Zhao, Qun-Xiong Zheng, Zhong-Xiao Wang, Wen-Feng Qi 0001   +3 more
openaire   +1 more source

Isomorphism Classes of Graph Bundles

Canadian Journal of Mathematics, 1990
AbstractRecently, M. Hofmeister [4] counted all nonisomorphic double coverings of a graph by using its Ζ2 cohomology groups, and J. Kwak and J. Lee [5] did the same work for some finite-fold coverings. In this paper, we give an algebraic characterization of isomorphic graph bundles, from which we get a formula to count all nonisomorphic graph-bundles ...
KWAK, JH, LEE, JE
openaire   +3 more sources

Isomorphism Testing in Hookup Classes

SIAM Journal on Algebraic Discrete Methods, 1982
Hookup classes are classes of graphs with a certain type of recursive definition, which can be viewed as a generalization of k-trees. We show that many hookup classes of graphs are isomorphism complete, and give polynomial isomorphism algorithms for the others. Other results in this paper include the development of a structural decomposition for hookup
Klawe, M. M., Corneil, D. G., Proskurowski, A.   +2 more
openaire   +2 more sources

Classifying Isomorphic Residue Classes

2001
We report on a case study on combining proof planning with computer algebra systems. We construct proofs for basic algebraic properties of residue classes as well as for isomorphisms between residue classes using different proving techniques, which are implemented as strategies in a multi-strategy proof planner.
Andreas Meier 0002, Martin Pollet, Volker Sorge   +2 more
openaire   +1 more source