Pan Tan

Orcid: 0000-0003-2086-0940

According to our database1, Pan Tan authored at least 16 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
PETA: evaluating the impact of protein transfer learning with sub-word tokenization on downstream applications.
J. Cheminformatics, December, 2024

RA-MMIR : Multi-modal image registration by Robust Adaptive Variation Attention Gauge Field.
Inf. Fusion, May, 2024

Simple, Efficient, and Scalable Structure-Aware Adapter Boosts Protein Language Models.
J. Chem. Inf. Model., 2024

COMET: Benchmark for Comprehensive Biological Multi-omics Evaluation Tasks and Language Models.
CoRR, 2024

2023
SESNet: sequence-structure feature-integrated deep learning method for data-efficient protein engineering.
J. Cheminformatics, December, 2023

The minimum locality of linear codes.
Des. Codes Cryptogr., 2023

Accurate and Definite Mutational Effect Prediction with Lightweight Equivariant Graph Neural Networks.
CoRR, 2023

2022
Linear codes from support designs of ternary cyclic codes.
Des. Codes Cryptogr., 2022

InterFace: Adjustable Angular Margin Inter-class Loss for Deep Face Recognition.
CoRR, 2022

2021
Cyclic LRCs with Availability from Linearized Polynomials.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021

Super-Scalable Molecular Dynamics Algorithm.
CoRR, 2021

The minimum linear locality of linear codes.
CoRR, 2021

2020
Two classes of optimal LRCs with information (r, t)-locality.
Des. Codes Cryptogr., 2020

2019
Optimal Cyclic Locally Repairable Codes via Cyclotomic Polynomials.
IEEE Commun. Lett., 2019

2018
The weight distribution of a class of two-weight linear codes derived from Kloosterman sums.
Cryptogr. Commun., 2018

2016
A Construction of Codebooks Nearly Achieving the Levenstein Bound.
IEEE Signal Process. Lett., 2016


  Loading...