default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZeshan Peng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j7]Halil Kilicoglu, Graciela Rosemblat, Linh K. Hoang, Sahil Wadhwa
, Zeshan Peng, Mario Malicki, Jodi Schneider, Gerben ter Riet:
Toward assessing clinical trial publications for reporting transparency. J. Biomed. Informatics 116: 103717 (2021)
2010 – 2019
- 2019
- [j6]Halil Kilicoglu, Zeshan Peng, Shabnam Tafreshi, Tung Tran, Graciela Rosemblat, Jodi Schneider:
Confirm or refute?: A comparative study on citation sentiment classification in clinical research publications. J. Biomed. Informatics 91 (2019) - 2018
- [c10]Zeshan Peng, Wenbo Wang, Bitty Balducci, Detelina Marinova, Yi Shang:
Toward Predicting Communication Effectiveness. DSC 2018: 76-83 - 2016
- [c9]Nickolas M. Wergeles, Charles Shang, Zeshan Peng, Haidong Wang, Joel Sartwell, Tom Treiman, Jeff Beringer, Jerrold L. Belant, Joshua J. Millspaugh, Jon T. McRoberts, Yi Shang:
Mobile Data Collection and Analysis in Conservation. SMARTCOMP 2016: 1-5 - 2011
- [j5]Jesper Jansson, Zeshan Peng:
Algorithms for Finding a Most Similar Subforest. Theory Comput. Syst. 48(4): 865-887 (2011)
2000 – 2009
- 2008
- [j4]Vincent Berry, Zeshan Peng, H. F. Ting:
From Constrained to Unconstrained Maximum Agreement Subtree in Linear Time. Algorithmica 50(3): 369-385 (2008) - 2007
- [j3]Jesper Jansson, Zeshan Peng:
Online and Dynamic Recognition of Squarefree Strings. Int. J. Found. Comput. Sci. 18(2): 401-414 (2007) - [c8]Zeshan Peng, Hing-Fung Ting:
Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge. CPM 2007: 195-204 - 2006
- [b1]Zeshan Peng:
Structure comparison in bioinformatics. University of Hong Kong, 2006 - [j2]Zeshan Peng, Hing-Fung Ting:
An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees. Inf. Process. Lett. 100(4): 137-144 (2006) - [j1]Ho-fung Leung, Zeshan Peng, Hing-Fung Ting:
An efficient algorithm for online square detection. Theor. Comput. Sci. 363(1): 69-75 (2006) - [c7]Jesper Jansson, Zeshan Peng:
Algorithms for Finding a Most Similar Subforest. CPM 2006: 377-388 - 2005
- [c6]Zeshan Peng:
Algorithms for Local Forest Similarity. ISAAC 2005: 704-713 - [c5]Jesper Jansson, Zeshan Peng:
Online and Dynamic Recognition of Squarefree Strings. MFCS 2005: 520-531 - [c4]Zeshan Peng, H. F. Ting:
An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree. WABI 2005: 104-115 - 2004
- [c3]Ho-fung Leung, Zeshan Peng, Hing-Fung Ting:
An Efficient Online Algorithm for Square Detection. COCOON 2004: 432-439 - [c2]Zeshan Peng, Hing-Fung Ting:
An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees. ISAAC 2004: 754-765 - [c1]Zeshan Peng, H. F. Ting:
Time and Space Efficient Algorithms for Constrained Sequence Alignment. CIAA 2004: 237-246
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 23:18 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:
