Benjarath Pupacdi's Homepage

Benjarath Pupacdi, Ph.D.
(My name was previously legally spelled as Benjarath Phoophakdee.)

I am a researcher at Chulabhorn Research Institute, Bangkok, Thailand.

My research interest is in data mining and bioinformatics. My dissertation was on DNA sequence indexing via persistent suffix tree. My advisor was Prof. Mohammed J. Zaki. Previously, I worked in his SPIDER group in Data Mining until 2004.

Education

Ph.D. in Computer Science from Rensselaer Polytechnic Institute, New York (2007)

M.S. in Computer Science also from RPI (2002)

B.S. in Computer Science from the Johns Hopkins University, Maryland (2000)

I graduated from The Peddie School, New Jersey in 1996.

My Resume

Email: my_First_NaMe aT gmail dOt coM

Publications

Benjarath Phoophakdee and Mohammed J. Zaki, Trellis+: An Effective Approach for Indexing Massive Sequence, Pacific Symposium on Biocomputing, Hawaii, USA, January 2008.
Benjarath Phoophakdee and Mohammed J. Zaki, Genome-scale Disk-based Suffix Tree Indexing , ACM SIGMOD International Conference on Management of Data, Beijing, China, June 2007. (14% Acceptance Rate, CS Conference Ranking)
Mohammed J. Zaki, Nagender Parimi, Nilanjana De, Feng Gao, Benjarath Phoophakdee, Joe Urban, Vineet Chaoji, Mohammad Al Hasan, Saeed Salem, Towards Generic Pattern Mining, International Conference on Formal Concept Analysis (Invited Paper), Lens, France, February 2005 (Also LNCS 3403, Springer-Verlag, and RPI CS Dept Technical Report 04-01, Jan 2004)
Mohammed J. Zaki, Nilanjana De, Feng Gao, Paolo Palmerini, Nagender Parimi, Jeevan Pathuri, Benjarath Phoophakdee, Joe Urban, Generic Pattern Mining Via Data Mining Template Library, Constraint-Based Mining and Inductive Databases, 2004

Technical Reports

Benjarath Phoophakdee and Mohammed J. Zaki, Trellis: An Effective Algorithm for Constructing Disk-based Suffix Trees with Suffix Links. RPI CS Dept Technical Report 06-03, 2006.
Mohammed J. Zaki and Benjarath Phoophakdee, MIRAGE: A framework for mining, exploring and visualizing minimal association rules. RPI CS Dept Technical Report 03-04, July 2003.

Programs

TRELLIS+: This program accompanies our suffix tree indexing algorithm for genome-scale DNA sequences in the papers listed above.
It was written in C++ and compiled under both g++3.4.3 and g++4.0. TRELLIS+ is licensed under the GNU General Public License.
TRELLIS+ with String Buffer (available upon request)

Personal

Soi Dog Foundation (Soi Dog = Street Dog) Please consider helping them. Just for around 9 bucks a month, you can save a life of a helpless dog or cat.

Food I made