Hunting Redundancies in Strings. - Golnaz Badkobeh; Supaporn Chairungsee; Maxime Crochemore (Developments in Language Theory, 2011)

Building Phylogeny with Minimal Absent Words. - Supaporn Chairungsee; Maxime Crochemore (CIAA, 2011)

Using minimal absent words to build phylogeny. - Supaporn Chairungsee; Maxime Crochemore (Theor. Comput. Sci., 2012)

A New Approach for Phylogenetic Tree Construction Based on Minimal Absent Words. - Supaporn Chairungsee (DEXA Workshops, 2014)

Longest Previous Non-overlapping Factors Computation. - Supaporn Chairungsee; Tida Butrak; Surangkanang Chareonrak; Thana Charuphanthuset (DEXA Workshops, 2015)

Searching for Gapped Palindrome. - Supaporn Chairungsee (DEXA Workshops, 2016)

Computation of String Repetition. - Supaporn Chairungsee; Thana Charuphanthuset (DEXA Workshops, 2016)

Longest Previous Non-overlapping Factors Table Computation. - Supaporn Chairungsee; Maxime Crochemore (COCOA (2), 2017)

Efficient Approaches to Compute Longest Previous Non-overlapping Factor Array. - Supaporn Chairungsee (Fundam. Informaticae, 2018)

An Approach for LPF Table Computation. - Supaporn Chairungsee; Thana Charuphanthuset (DEXA Workshops, 2019)

A Linear Time Algorithm for Finding Tandem Repeat in DNA Sequences. - Tida Butrak; Supaporn Chairungsee (ICIT, 2019)

Algorithm for Palindrome Detection by Suffix Heap. - Surangkanang Charoenrak; Supaporn Chairungsee (ICIT, 2019)

Knowledge-Based Ontology Development for Folk Medicine. - Salintip Ratsamano; Supaporn Chairungsee (ICIT, 2019)

The Effective of Algorithms on Web Application Development to Detect Repetitive DNA. - Tida Butrak; Surangkanang Charoenrak; Thana Charuphanthuset; Supaporn Chairungsee (ICIT, 2023)

Algorithm of Palindrome Detection Tool. - Surangkanang Charoenrak; Tida Butrak; Thana Charuphanthuset; Supaporn Chairungsee (ICIT, 2023)

Enhancing Cultural Heritage Accessibility Through Three-Dimensional Artifact Visualization on Web-Based Open Frameworks. - Sasithorn Rattanarungrot; Martin White; Supaporn Chairungsee (Informatics, 2025)