Adiesha Liyanage

According to our database, Adiesha Liyanage authored at least 9 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Computing and Enumerating Minimal Common Supersequences Between Two Strings.

Braeden Sopp, Adiesha Liyanage, Mingyang Gong, Binhai Zhu

CoRR, March, 2026

Computing Maximal Repeating Subsequences in a String.

Mingyang Gong, Adiesha Liyanage, Braeden Sopp, Binhai Zhu

CoRR, January, 2026

2025

Fast Approximate Rank Determination and Selection with Group Testing.

Adiesha Liyanage, Braeden Sopp, Brendan Mumey

CoRR, July, 2025

On the difficulty of order constrained pattern matching with applications to feature matching based malware detection.

Adiesha Liyanage, Braeden Sopp, Binhai Zhu

CoRR, March, 2025

The longest subsequence-duplicated subsequence and related problems.

Manuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu

Inf. Comput., 2025

2024

The longest letter-duplicated subsequence and related problems.

Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou

Acta Informatica, September, 2024

2023

The Longest Subsequence-Repeated Subsequence Problem.

Manuel Lafond, Wenfeng Lai, Adiesha Liyanage, Binhai Zhu

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

The Complexity of Finding Common Partitions of Genomes with Predefined Block Sizes.

Manuel Lafond, Adiesha Liyanage, Binhai Zhu, Peng Zou

Proceedings of the Comparative Genomics - 19th International Conference, 2022

Beyond the Longest Letter-Duplicated Subsequence Problem.

Wenfeng Lai, Adiesha Liyanage, Binhai Zhu, Peng Zou

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022