H
Heejin Park
Researcher at Hanyang University
Publications - 51
Citations - 1102
Heejin Park is an academic researcher from Hanyang University. The author has contributed to research in topics: Compressed suffix array & Generalized suffix tree. The author has an hindex of 18, co-authored 47 publications receiving 979 citations. Previous affiliations of Heejin Park include Seoul National University.
Papers
More filters
Book ChapterDOI
Linear-time construction of suffix arrays
TL;DR: A linear-time algorithm to construct suffix arrays for integer alphabets, which do not use suffix trees as intermediate data structures during its construction, and implies that the time complexity of directly constructing suffix arrays matches that of constructing suffix trees.
Journal ArticleDOI
Proteogenomic Characterization of Human Early-Onset Gastric Cancer
Dong Gi Mun,Jinhyuk Bhin,Jinhyuk Bhin,Sangok Kim,Hyunwoo Kim,Hyunwoo Kim,Jae Hun Jung,Yeonjoo Jung,Ye Eun Jang,Jong-Moon Park,Hokeun Kim,Yeonhwa Jung,Hangyeore Lee,Jingi Bae,Seunghoon Back,Su Jin Kim,Ji-Eun Kim,Heejin Park,Honglan Li,Kyu-Baek Hwang,Young Soo Park,Jeong Hwan Yook,Byung Sik Kim,Sun Young Kwon,Seung Wan Ryu,Do Youn Park,Tae Yong Jeon,Dae Hwan Kim,Jae Hyuck Lee,Sang-Uk Han,Kyu Sang Song,Dongmin Park,Jun Won Park,Henry Rodriguez,Jaesang Kim,Hookeun Lee,Kwang Pyo Kim,Eun Gyeong Yang,Hark Kyun Kim,Eunok Paek,Sanghyuk Lee,Sang Won Lee,Daehee Hwang +42 more
TL;DR: Proteogenomic analysis of diffuse gastric cancers in young populations provides additional information beyond genomic analyses, which can improve understanding of cancer biology and patient stratification in diffuse GCs.
Journal ArticleDOI
Constructing suffix arrays in linear time
TL;DR: A linear-time algorithm to construct suffix arrays for integer alphabets, which do not use suffix trees as intermediate data structures during its construction, which implies that the time complexity of directly constructing suffix arrays matches that of constructing suffix trees.
Journal ArticleDOI
MODi: a powerful and convenient web server for identifying multiple post-translational peptide modifications from tandem mass spectra.
Sangtae Kim,Seungjin Na,Ji Woong Sim,Heejin Park,Jaeho Jeong,Hokeun Kim,Younghwan Seo,Jawon Seo,Kong-Joo Lee,Eunok Paek +9 more
TL;DR: MODi is powerful in that it can interpret a tandem mass spectrum even when hundreds of modification types are considered and the number of potential PTMs in a peptide is large, in contrast to most of the methods currently available for spectra interpretation that limit thenumber of PTM sites and types being used for PTM analysis.
Journal ArticleDOI
Unrestrictive Identification of Multiple Post-translational Modifications from Tandem Mass Spectrometry Using an Error-tolerant Algorithm Based on an Extended Sequence Tag Approach
TL;DR: A new algorithm, called MODi (pronounced “mod eye”), that rapidly searches for all known types of PTMs at once without limiting a multitude of modified sites in a peptide, which may exist in a greater variety than usually expected.