Lianrong Pu

According to our database1, Lianrong Pu authored at least 13 papers between 2015 and 2024.

Collaborative distances:

Timeline

2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
2
2
1
1
1
1
1
1
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
ULTR-asm: assembly of ultra long tandem repeat.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2024

2022
Machine learning and deep learning methods for wireless network applications.
EURASIP J. Wirel. Commun. Netw., 2022

3CAC: improving the classification of phages and plasmids in metagenomic assemblies using assembly graphs.
Bioinform., 2022

2021
AIEpred: An Ensemble Predictive Model of Classifier Chain to Identify Anti-Inflammatory Peptides.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

Editorial.
Int. J. Distributed Sens. Networks, 2021

Improving the efficiency of de Bruijn graph construction using compact universal hitting sets.
Proceedings of the BCB '21: 12th ACM International Conference on Bioinformatics, 2021

2020
A 1.375-approximation algorithm for unsigned translocation sorting.
J. Comput. Syst. Sci., 2020

2018
Can a breakpoint graph be decomposed into none other than 2-cycles?
Theor. Comput. Sci., 2018

A Randomized FPT Approximation Algorithm for Maximum Alternating-Cycle Decomposition with Applications.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Approximating Max NAE-k-SAT by anonymous local search.
Theor. Comput. Sci., 2017

2016
A New Approximation Algorithm for Unsigned Translocation Sorting.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016

Can a Breakpoint Graph be Decomposed into None Other Than 2-Cycles?
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2015
Local Search to Approximate Max NAE- k k -Sat Tightly.
Proceedings of the Frontiers in Algorithmics - 9th International Workshop, 2015


  Loading...