Efficient algorithms for three variants of the LPF table-Reference-Cited by-同舟云学术

Efficient algorithms for three variants of the LPF table

Author:

Crochemore Maxime,Iliopoulos Costas S.,Kubica Marcin,Rytter Wojciech,Waleń Tomasz

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference29 articles.

1. Text Compression;Bell,1990

2. The LCA problem revisited;Bender,2000

3. Algorithmic Aspects of Bioinformatics;Böckenhauer,2007

4. Efficient computing of longest previous reverse factors;Chairungsee,2009

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Effective of Algorithms on Web Application Development to Detect Repetitive DNA;Proceedings of the 2023 11th International Conference on Information Technology: IoT and Smart City;2023-12-14

2. Algorithm of Palindrome Detection Tool;Proceedings of the 2023 11th International Conference on Information Technology: IoT and Smart City;2023-12-14

3. The Development of a Web Service for Tandem Repeat Detection;2023 27th International Computer Science and Engineering Conference (ICSEC);2023-09-14

4. Web Service for Palindrome Detection from Algorithm Sequence;2023 27th International Computer Science and Engineering Conference (ICSEC);2023-09-14

5. Longest previous overlapping factor array;Information Processing Letters;2021-06