Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jianli Gong

dblp:13/3237 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › synthetic biology
codon optimization
0.812024
CodonBERT: a BERT-based architecture tailored for codon optimization using the cross-attention mechanism · Bioinform. 2024

Methods — techniques the papers use, named apart from their topics

masked language modeling · 0.8cross-attention mechanism · 0.8BERT · 0.8
YearPublicationVenuePosition
2024 CodonBERT: a BERT-based architecture tailored for codon optimization using the cross-attention mechanism
abstract
MOTIVATION: Due to the varying delivery methods of mRNA vaccines, codon optimization plays a critical role in vaccine design to improve the stability and expression of proteins in specific tissues. Considering the many-to-one relationship between synonymous codons and amino acids, the number of mRNA sequences encoding the same amino acid sequence could be enormous. Finding stable and highly expressed mRNA sequences from the vast sequence space using in silico methods can generally be viewed as a path-search problem or a machine translation problem. However, current deep learning-based methods inspired by machine translation may have some limitations, such as recurrent neural networks, which have a weak ability to capture the long-term dependencies of codon preferences. RESULTS: We develop a BERT-based architecture that uses the cross-attention mechanism for codon optimization. In CodonBERT, the codon sequence is randomly masked with each codon serving as a key and a value. In the meantime, the amino acid sequence is used as the query. CodonBERT was trained on high-expression transcripts from Human Protein Atlas mixed with different proportions of high codon adaptation index codon sequences. The result showed that CodonBERT can effectively capture the long-term dependencies between codons and amino acids, suggesting that it can be used as a customized training framework for specific optimization targets. AVAILABILITY AND IMPLEMENTATION: CodonBERT is freely available on https://github.com/FPPGroup/CodonBERT.
Zilin Ren, Yaxin Di, Dufei Zhang, Jianli Gong, Jianting Gong, Qiwei Jiang, Zhiguo Fu
Bioinform.5
2007 Exchange market for complex commodities: search for optimal matches
abstract
The Internet has led to the development of online markets, and computer scientists have designed various auction algorithms, as well as automated exchanges for standardized commodities; however, they have done little work on exchanges for complex non-standard goods. We present an exchange system for trading complex goods, such as used cars or non-standard financial securities. The system allows traders to represent their buy and sell orders by multiple attributes; for example, a car buyer can specify a model, options, colour, and other desirable features. Traders can also provide complex price constraints, along with preferences among acceptable trades; for instance, a car buyer can specify dependency of an acceptable price on the model, year of production, and mileage. We describe the representation and indexing of orders, and give algorithms for fast identification of matches between buy and sell orders. The system identifies the most preferable matches, which maximize trader satisfaction, and it allows control over the trade-off between speed and optimality of matching. It supports markets with up to 300 000 orders, and processes hundreds of new orders per second.
Eugene Fink, Jianli Gong, Josh Johnson
J. Exp. Theor. Artif. Intell.2
2004 Data mining techniques for cancer detection using serum proteomic profiling
Lihua Li 0002, Zuobao Wu, Jianli Gong, Michael Gruidl, Melvyn S. Tockman, Robert A. Clark
Artif. Intell. Medicine4