E-LIB Suche - Ergebnisse für: Liyanage, Adiesha - Sprache DE

Personensuche X

Sortierung: Relevanz

Sortierung: Jahr

1

The longest letter-duplicated subsequence and related probl..:

Lai, Wenfeng ; Liyanage, Adiesha ; Zhu, Binhai.
Acta Informatica. 61 (2024) 3 - p. 315-329 , 2024

Link: https://doi.org/10.1007/..

2

The Longest Subsequence-Repeated Subsequence Problem:

, In: Combinatorial Optimization and Applications; Lecture Notes in Computer Science,

Lafond, Manuel ; Lai, Wenfeng ; Liyanage, Adiesha. - p. 446-458 , 2023

Link: https://doi.org/10.1007/..

3

The Complexity of Finding Common Partitions of Genomes with..:

, In: Comparative Genomics; Lecture Notes in Computer Science,

Lafond, Manuel ; Liyanage, Adiesha ; Zhu, Binhai. - p. 105-123 , 2022

Link: https://doi.org/10.1007/..

4

The Longest Subsequence-Repeated Subsequence Problem:

Lafond, Manuel ; Lai, Wenfeng ; Liyanage, Adiesha.
http://arxiv.org/abs/2304.06862. , 2023

Link: http://arxiv.org/abs/230..

5

Beyond the Longest Letter-Duplicated Subsequence Problem:

Lai, Wenfeng ; Liyanage, Adiesha ; Zhu, Binhai.
Is Part Of LIPIcs, Volume 223, 33rd Annual Symposium on Combinatorial Pattern Matching (CPM 2022). , 2022

Link: https://doi.org/10.4230/..

6

Beyond the Longest Letter-duplicated Subsequence Problem:

Lai, Wenfeng ; Liyanage, Adiesha ; Zhu, Binhai.
http://arxiv.org/abs/2112.05725. , 2021

Link: http://arxiv.org/abs/211..

1-6