default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSeung-Jin Sul
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c10]Jonathan Bader
, Jim Belak, Matthew T. Bement, Matthew Berry, Robert Carson, Daniela Cassol, Stephen Chan, John Coleman, Kastan Day, Alejandro Duque, Kjiersten Fagnan, Jeff Froula, Shantenu Jha, Daniel S. Katz, Piotr Kica, Volodymyr V. Kindratenko, Edward Kirton, Ramani Kothadia, Daniel E. Laney, Fabian Lehmann, Ulf Leser, Sabina Licholai, Maciej Malawski, Mario Melara, Elais Player Jackson, Matthew Rolchigo, Setareh Sarrafan, Seung-Jin Sul, Abdullah Syed, Lauritz Thamsen, Mikhail Titov, Matteo Turilli, Silvina Caíno-Lores, Anirban Mandal:
Novel Approaches Toward Scalable Composable Workflows in Hyper-Heterogeneous Computing Environments. SC Workshops 2023: 2097-2108
2010 – 2019
- 2011
- [j2]Seung-Jin Sul, Tiffani L. Williams:
Big Cat Phylogenies, Consensus Trees, and Computational Thinking. J. Comput. Biol. 18(7): 895-906 (2011) - [c9]Seung-Jin Sul, Andrey Tovchigrechko:
Parallelizing BLAST and SOM Algorithms with MapReduce-MPI Library. IPDPS Workshops 2011: 481-489 - 2010
- [c8]Suzanne J. Matthews, Seung-Jin Sul, Tiffani L. Williams:
TreeZip: A New Algorithm for Compressing Large Collections of Evolutionary Trees. DCC 2010: 544 - [c7]Suzanne J. Matthews, Seung-Jin Sul, Tiffani L. Williams:
A Novel Approach for Compressing Phylogenetic Trees. ISBRA 2010: 113-124
2000 – 2009
- 2009
- [j1]Seung-Jin Sul, Suzanne J. Matthews, Tiffani L. Williams:
Using tree diversity to compare phylogenetic heuristics. BMC Bioinform. 10(S-4) (2009) - [c6]Seung-Jin Sul, Tiffani L. Williams:
An Experimental Analysis of Consensus Tree Algorithms for Large-Scale Tree Collections. ISBRA 2009: 100-111 - 2008
- [c5]Seung-Jin Sul, Suzanne J. Matthews, Tiffani L. Williams:
New Approaches to Compare Phylogenetic Search Heuristics. BIBM 2008: 239-245 - [c4]Seung-Jin Sul, Tiffani L. Williams:
An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms. ESA 2008: 793-804 - [c3]Seung-Jin Sul, Grant R. Brammer, Tiffani L. Williams:
Efficiently Computing Arbitrarily-Sized Robinson-Foulds Distance Matrices. WABI 2008: 123-134 - 2007
- [c2]Seung-Jin Sul, Tiffani L. Williams:
A Randomized Algorithm for Comparing Sets of Phylogenetic Trees. APBC 2007: 121-130
1990 – 1999
- 1999
- [c1]Seung-Jin Sul, Keum-Suk Lee:
Agent-On-Demand for Distributed System Management. PDPTA 1999: 666-671
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 2024-04-24 22:53 CEST 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:
