default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKaizhong Zhang
- > Home > Persons > Kaizhong Zhang
Publications
- 2005
[j33]Jason Tsong-Li Wang, Xiong Wang, Dennis E. Shasha, Kaizhong Zhang:
MetricMap: an embedding technique for processing distance-based queries in metric spaces. IEEE Trans. Syst. Man Cybern. Part B 35(5): 973-987 (2005)- 2002
- [j28]Jason Tsong-Li Wang, Kaizhong Zhang, George Jyh-Shian Chang, Dennis E. Shasha:
Finding approximate patterns in undirected acyclic graphs. Pattern Recognit. 35(2): 473-483 (2002) - [j26]Xiong Wang, Jason Tsong-Li Wang, Dennis E. Shasha, Bruce A. Shapiro, Isidore Rigoutsos
, Kaizhong Zhang:
Finding Patterns in Three-Dimensional Graphs: Algorithms and Applications to Scientific Data Mining. IEEE Trans. Knowl. Data Eng. 14(4): 731-749 (2002) - [c31]Dennis E. Shasha, Jason Tsong-Li Wang, Huiyuan Shan, Kaizhong Zhang:
ATreeGrep: Approximate Searching in Unordered Trees. SSDBM 2002: 89-98 - 2000
- [j21]Xiong Wang, Jason Tsong-Li Wang, King-Ip (David) Lin, Dennis E. Shasha, Bruce A. Shapiro, Kaizhong Zhang:
An Index Structure for Data Mining and Clustering. Knowl. Inf. Syst. 2(2): 161-184 (2000) - [c26]Jason Tsong-Li Wang, Xiong Wang, Dennis E. Shasha, Bruce A. Shapiro, Kaizhong Zhang, Xinhuan Zheng, Qicheng Ma, Zasha Weinberg:
An Approximate Search Engine for Structural Databases. SIGMOD Conference 2000: 584 - 1999
- [c23]Jason Tsong-Li Wang, Xiong Wang, King-Ip (David) Lin, Dennis E. Shasha, Bruce A. Shapiro, Kaizhong Zhang:
Evaluating a Class of Distance-Mapping Algorithms for Data Mining and Clustering. KDD 1999: 307-311 - 1998
- [j19]Jason Tsong-Li Wang, Bruce A. Shapiro, Dennis E. Shasha, Kaizhong Zhang, Kathleen M. Currey:
An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees. IEEE Trans. Pattern Anal. Mach. Intell. 20(8): 889-895 (1998) - [c21]Yanling Yang, Kaizhong Zhang, Xiong Wang, Jason Tsong-Li Wang, Dennis E. Shasha:
An Approximate Oracle for Distance in Metric Spaces. CPM 1998: 104-117 - 1997
- [c20]Xiong Wang, Jason Tsong-Li Wang, Dennis E. Shasha, Bruce A. Shapiro, Sitaram Dikshitulu, Isidore Rigoutsos, Kaizhong Zhang:
Automated Discovery of Active Motifs in Three Dimensional Molecules. KDD 1997: 89-95 - [c19]Jason Tsong-Li Wang, Dennis E. Shasha, George Jyh-Shian Chang, Liam Relihan, Kaizhong Zhang, Girish Patel:
Structural Matching and Discovery in Document Databases. SIGMOD Conference 1997: 560-563 - [p1]Kaizhong Zhang, Dennis E. Shasha:
Tree pattern matching. Pattern Matching Algorithms 1997: 341-371 - 1996
- [j14]Kaizhong Zhang, Jason Tsong-Li Wang, Dennis E. Shasha:
On the Editing Distance Between Undirected Acyclic Graphs. Int. J. Found. Comput. Sci. 7(1): 43-58 (1996) - [c17]Jason Tsong-Li Wang, Bruce A. Shapiro, Dennis E. Shasha, Kaizhong Zhang, Chia-Yo Chang:
Automated Discovery of Active Motifs in Multiple RNA Secondary Structures. KDD 1996: 70-75 - 1995
- [c15]Kaizhong Zhang, Jason Tsong-Li Wang, Dennis E. Shasha:
On the Editing Distance between Undirected Acyclic Graphs and Related Problems. CPM 1995: 395-407 - [c14]Jason Tsong-Li Wang, Kaizhong Zhang, Dennis E. Shasha:
Pattern Matching and Pattern Discovery in Scientific, Program, and Document Databases. SIGMOD Conference 1995: 487 - 1994
- [j8]Kaizhong Zhang, Dennis E. Shasha, Jason Tsong-Li Wang:
Approximate Tree Matching in the Presence of Variable Length Don't Cares. J. Algorithms 16(1): 33-66 (1994) - [j7]Jason Tsong-Li Wang, Kaizhong Zhang, Karpjoo Jeong, Dennis E. Shasha:
A System for Approximate Tree Matching. IEEE Trans. Knowl. Data Eng. 6(4): 559-571 (1994) - [j6]Dennis E. Shasha, Jason Tsong-Li Wang, Kaizhong Zhang, Frank Y. Shih:
Exact and approximate algorithms for unordered tree matching. IEEE Trans. Syst. Man Cybern. 24(4): 668-678 (1994) - [c8]Jason Tsong-Li Wang, Gung-Wei Chirn, Thomas G. Marr, Bruce A. Shapiro, Dennis E. Shasha, Kaizhong Zhang:
Combinatorial Pattern Discovery for Scientific Data: Some Preliminary Results. SIGMOD Conference 1994: 115-125 - 1992
- [j4]Kaizhong Zhang, Richard Statman, Dennis E. Shasha:
On the Editing Distance Between Unordered Labeled Trees. Inf. Process. Lett. 42(3): 133-139 (1992) - [c6]Kaizhong Zhang, Dennis E. Shasha, Jason Tsong-Li Wang:
Fast Serial and Parallel Algorithms for Approximate Tree Matching with VLDC's. CPM 1992: 151-161 - [c5]Dennis E. Shasha, Jason Tsong-Li Wang, Kaizhong Zhang, Frank Yeong-Chyang Shih:
Pattern Matching in Unordered Trees. ICTAI 1992: 352-361 - 1991
- [c2]Jason Tsong-Li Wang, Kaizhong Zhang, Karpjoo Jeong, Dennis E. Shasha:
A tool for tree pattern matching. ICTAI 1991: 436-444 - 1990
- [j2]Dennis E. Shasha, Kaizhong Zhang:
Fast Algorithms for the Unit Cost Editing Distance Between Trees. J. Algorithms 11(4): 581-621 (1990) - 1989
- [j1]Kaizhong Zhang, Dennis E. Shasha:
Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems. SIAM J. Comput. 18(6): 1245-1262 (1989) - [c1]Dennis E. Shasha, Kaizhong Zhang:
Fast Parallel Algorithms for the Unit Cost Editing Distance Between Trees. SPAA 1989: 117-126
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:
