Author of the publication

An Analysis of Multi-type Relational Interactions in FMA Using Graph Motifs with Disjointness Constraints.

, , , , , and . AMIA, AMIA, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

An Analysis of Multi-type Relational Interactions in FMA Using Graph Motifs with Disjointness Constraints., , , , , and . AMIA, AMIA, (2012)iEnhancer-BERT: A Novel Transfer Learning Architecture Based on DNA-Language Model for Identifying Enhancers and Their Strength., , , , and . ICIC (2), volume 13394 of Lecture Notes in Computer Science, page 153-165. Springer, (2022)SENet: A deep learning framework for discriminating super- and typical enhancers by sequence information., , , , , and . Comput. Biol. Chem., (August 2023)Iusing Biomedical Knowledge into BERT for Chinese Biomedical NLP Tasks with Adversarial Training., , and . ASSE, page 108-114. ACM, (2022)Deciding Bisimilarity of Full BPA Processes Locally.. ATVA, volume 5311 of Lecture Notes in Computer Science, page 347-360. Springer, (2008)Multi-scale DNA language model improves 6 mA binding sites prediction., , , , and . Comput. Biol. Chem., (2024)A Hybrid Deep Learning Model for Text Classification., , , , and . SKG, page 46-52. IEEE, (2018)An Effective Coalgebraic Bisimulation Proof Method.. CMCS, volume 164 of Electronic Notes in Theoretical Computer Science, page 105-119. Elsevier, (2006)Joint SPSL and CCWR for Chinese Short Text Entity Recognition and Linking., , , , and . IFTC, volume 1181 of Communications in Computer and Information Science, page 186-199. Springer, (2019)A Computational Framework for Predicting Novel Drug Indications Using Graph Convolutional Network With Contrastive Learning., , , , , and . IEEE J. Biomed. Health Informatics, 28 (8): 4503-4511 (August 2024)