default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJaebum Kim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j16]Heesun Kim, Mikang Sim, Na Young Park
, Kisang Kwon, Junyoung Kim, Jaebum Kim:
msPIPE: a pipeline for the analysis and visualization of whole-genome bisulfite sequencing data. BMC Bioinform. 23(1): 383 (2022)- [j15]Suyeon Wy, Daehong Kwon, Kisang Kwon, Jaebum Kim:
DLEB: a web application for building deep learning models in biological research. Nucleic Acids Res. 50(W1): 254-260 (2022) - 2020
- [j14]Mikang Sim, Jongin Lee, Daehwan Lee, Daehong Kwon, Jaebum Kim:
TAMA: improved metagenomic sequence classification through meta-analysis. BMC Bioinform. 21(1): 185 (2020)
2010 – 2019
- 2019
- [j13]Daehong Kwon, Jongin Lee, Jaebum Kim:
GMASS: a novel measure for genome assembly structural similarity. BMC Bioinform. 20(1): 147:1-147:9 (2019) - 2018
- [j12]Jongin Lee, Daehwan Lee, Mikang Sim, Daehong Kwon, Juyeon Kim, Younhee Ko, Jaebum Kim:
mySyntenyPortal: an application package to construct websites for synteny block analysis. BMC Bioinform. 19(1): 216:1-216:7 (2018) - [j11]Daehong Kwon, Daehwan Lee, Juyeon Kim, Jongin Lee, Mikang Sim, Jaebum Kim:
INTERSPIA: a web application for exploring the dynamics of protein-protein interactions among multiple species. Nucleic Acids Res. 46(Webserver-Issue): W89-W94 (2018) - 2017
- [j10]Chris Bryan, Gregory Guterman, Kwan-Liu Ma, Harris A. Lewin, Denis M. Larkin, Jaebum Kim, Jian Ma, Marta Farre:
Synteny Explorer: An Interactive Visualization Application for Teaching Genome Evolution. IEEE Trans. Vis. Comput. Graph. 23(1): 711-720 (2017) - [c8]Juyeon Kim, Daehwan Lee, Mikang Sim, Jongin Lee, Jaebum Kim:
The effect of reference species on reference-guided genome assembly. CSBio 2017: 23-27 - 2016
- [j9]Jongin Lee, Woonyoung Hong, Minah Cho, Mikang Sim, Daehwan Lee, Younhee Ko, Jaebum Kim:
Synteny Portal: a web-based application portal for synteny block analysis. Nucleic Acids Res. 44(Webserver-Issue): W35-W40 (2016) - 2014
- [j8]Jaebum Kim, Jian Ma:
PSAR-Align: improving multiple sequence alignment using probabilistic sampling. Bioinform. 30(7): 1010-1012 (2014) - [c7]Ho-Sik Seok, Woonyoung Hong, Jaebum Kim:
Estimating the number of species in metagenomes by clustering next-generation read sequences. BigComp 2014: 52-53 - 2013
- [j7]Jaebum Kim, Denis M. Larkin, Qingle Cai, Asan, Yongfen Zhang, Ri-Li Ge, Loretta Auvil, Boris Capitanu, Guojie Zhang, Harris A. Lewin, Jian Ma:
Reference-assisted chromosome assembly. Proc. Natl. Acad. Sci. USA 110(5): 1785-1790 (2013) - 2011
- [c6]Jaebum Kim, Jian Ma:
PSAR: Measuring Multiple Sequence Alignment Reliability by Probabilistic Sampling - (Extended Abstract). RECOMB 2011: 134-135 - 2010
- [b1]Jaebum Kim:
Probabilistic Model-Based Approach to Evolutionary Analysis of Non-Coding Sequences. University of Illinois Urbana-Champaign, USA, 2010 - [j6]Jaebum Kim, Saurabh Sinha:
Towards realistic benchmarks for multiple alignments of non-coding sequences. BMC Bioinform. 11: 54 (2010) - [j5]Jaebum Kim, Ryan Cunningham, Brian James, Stefan Wyder, Joshua D. Gibson, Oliver Niehuis, Evgeny M. Zdobnov, Hugh M. Robertson, Gene E. Robinson, John H. Werren, Saurabh Sinha:
Functional Characterization of Transcription Factor Motifs Using Cross-species Comparison across Large Evolutionary Distances. PLoS Comput. Biol. 6(1) (2010)
2000 – 2009
- 2008
- [c5]Kyuho Shim, Young-Rae Cho, Namdo Kim, Hyuncheol Baik, Kyungkuk Kim, Dusung Kim, Jaebum Kim, Byeongun Min, Kyumyung Choi, Maciej J. Ciesielski, Seiyang Yang:
A fast two-pass HDL simulation with on-demand dump. ASP-DAC 2008: 422-427 - [c4]Sangkyum Kim, Jaebum Kim, Younhee Ko, Seung-won Hwang, Jiawei Han:
PerRank: Personalized Rank Retrieval with Categorical and Numerical Attributes. WAIM 2008: 270-277 - 2007
- [j4]Jaebum Kim, Saurabh Sinha:
Indelign: a probabilistic framework for annotation of insertions and deletions in a multiple alignment. Bioinform. 23(3): 289-297 (2007) - [j3]Jaebum Kim, J. Kim, Hyuncheol Park, B. Kim, S. Park:
Modified enhanced max-log-maximum a posteriori algorithm using variable scaling factor. IET Commun. 1(5): 1061-1066 (2007) - 2006
- [c3]Heesang Lee, Gyuseok Shim, Yun Bae Kim, Jinsoo Park, Jaebum Kim:
A Search Ant and Labor Ant Algorithm for Clustering Data. ANTS Workshop 2006: 500-501 - 2005
- [j2]Jaebum Kim, Namshik Kim, Kumran Ji, Seungwon Kim, Hyuncheol Park:
A new enhanced coding scheme for robust bit-stream of ATSC DTV. IEEE Trans. Consumer Electron. 51(2): 457-462 (2005) - [j1]Jaebum Kim, Namshik Kim, Kumran Ji, Seungwon Kim, Hyuncheol Park:
Corrections to "A new enhanced coding scheme for robust bit-stream of ATSC DTV". IEEE Trans. Consumer Electron. 51(4): 1387 (2005) - 2004
- [c2]Yun Bae Kim, Chang Hun Lee, Jaebum Kim, Gyutai Kim, Jong Seon Hong:
Empirical Analysis for Individual Behavior of Impatient Customers in a Call Center. AsiaSim 2004: 334-342 - 2002
- [c1]Dongkyu Kim, Jaebum Kim, Sang-goo Lee:
Catalog Integration for Electronic Commerce through Category-Hierarchy Merging Technique. RIDE 2002: 28-33
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
