![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Yongwook Choi
Person information
- affiliation: Purdue University, West Lafayette, USA
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j6]Josh L. Espinoza, Chris L. Dupont, Aubrie O'Rourke
, Sinem Beyhan, Pavel Morales, Amy Spoering, Kirsten J. Meyer
, Agnes P. Chan, Yongwook Choi, William C. Nierman, Kim Lewis, Karen E. Nelson:
Predicting antimicrobial mechanism-of-action from transcriptomes: A generalizable explainable artificial intelligence approach. PLoS Comput. Biol. 17(3) (2021)
2010 – 2019
- 2015
- [j5]Yongwook Choi
, Agnes P. Chan
:
PROVEAN web server: a tool to predict the functional effect of amino acid substitutions and indels. Bioinform. 31(16): 2745-2747 (2015) - 2012
- [j4]Yongwook Choi, Charles Knessl, Wojciech Szpankowski:
On a Recurrence Arising in Graph Compression. Electron. J. Comb. 19(3): 15 (2012) - [j3]Yongwook Choi
, Wojciech Szpankowski:
Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments. IEEE Trans. Inf. Theory 58(2): 620-638 (2012) - [c8]Yongwook Choi
:
A fast computation of pairwise sequence alignment scores between a protein and a set of single-locus variants of another protein. BCB 2012: 414-417 - 2011
- [j2]Yongwook Choi
, Wojciech Szpankowski:
Constrained pattern matching. ACM Trans. Algorithms 7(2): 25:1-25:19 (2011) - 2010
- [b1]Yongwook Choi:
Structural information in strings and graphs. Purdue University, USA, 2010 - [c7]Yongwook Choi:
Fast Algorithm for Optimal Compression of Graphs. ANALCO 2010: 34-46
2000 – 2009
- 2009
- [j1]Yongwook Choi
, Gopal Pandurangan
, Maleq Khan, V. S. Anil Kumar:
Energy-Optimal Distributed Algorithms for Minimum Spanning Trees. IEEE J. Sel. Areas Commun. 27(7): 1297-1304 (2009) - [c6]Yongwook Choi
, Wojciech Szpankowski:
Compression of graphical structures. ISIT 2009: 364-368 - 2008
- [c5]Yongwook Choi
, Wojciech Szpankowski:
Large deviations for constrained pattern matching. ISIT 2008: 2141-2145 - [c4]Yongwook Choi
, Maleq Khan, V. S. Anil Kumar, Gopal Pandurangan
:
Energy-optimal distributed algorithms for minimum spanning trees. SPAA 2008: 188-190 - 2007
- [c3]Yongwook Choi
, Wojciech Szpankowski:
Pattern Matching in Constrained Sequences. ISIT 2007: 2606-2610 - 2006
- [c2]Alberto Apostolico, Yongwook Choi
:
Textual Compression by Collapsible Tries. DCC 2006: 437 - [c1]Alberto Apostolico, Yongwook Choi:
Compressing with Collapsible Tries. ITW 2006: 92-96
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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 2024-06-18 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint