Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiaodong Wang 0003
- > Home > Persons > Xiaodong Wang 0003
Publications
- 2019
[j10]Xiaodong Wang, Lei Wang, Daxin Zhu
:
Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints. J. Comput. Biol. 26(9): 938-947 (2019)- 2017
- [j9]Daxin Zhu, Yingjie Wu, Lei Wang, Xiaodong Wang:
A note on the largest number of red nodes in red-black trees. J. Discrete Algorithms 43: 81-94 (2017) - [j8]Daxin Zhu, Lei Wang, Tinran Wang, Xiaodong Wang:
A space efficient algorithm for the longest common subsequence in k-length substrings. Theor. Comput. Sci. 687: 79-92 (2017) - [c21]Daxin Zhu, Xiaodong Wang:
A Space Efficient Algorithm for LCIS Problem. SpaCCS 2017: 70-77 - [c20]Xiaodong Wang, Daxin Zhu:
Improving the Efficiency of Dynamic Programming in Big Data Computing. SpaCCS 2017: 78-86 - 2016
- [c19]Daxin Zhu, Yingjie Wu, Xiaodong Wang:
An Efficient Algorithm for a New Constrained LCS Problem. ACIIDS (2) 2016: 261-267 - [c18]Daxin Zhu, Yingjie Wu, Xiaodong Wang:
An Efficient Dynamic Programming Algorithm for STR-IC-STR-EC-LCS Problem. GPC 2016: 3-17 - [c17]Xiaodong Wang, Yingjie Wu, Daxin Zhu:
A Polynomial Time Algorithm for a Generalized Longest Common Subsequence Problem. GPC 2016: 18-29 - [c16]Xiaodong Wang, Jun Tian, Daxin Zhu:
A Novel Algorithm to Determine the Cutoff Score. HIS 2016: 43-48 - [c15]Daxin Zhu, Tinran Wang, Xiaodong Wang:
On Determination of Balance Ratio for Some Tree Structures. NPC 2016: 205-212 - [c14]Daxin Zhu, Yingjie Wu, Xiaodong Wang:
An Efficient Dynamic Programming Algorithm for STR-IC-STR-IC-LCS Problem. PAKDD (2) 2016: 466-477 - [c13]Xiaodong Wang, Daxin Zhu:
Efficient Computation for the Longest Common Subsequence with Substring Inclusion and Subsequence Exclusion Constraints. SmartCom 2016: 419-428 - [c12]Daxin Zhu, Xiaodong Wang:
An Optimal Algorithm for a Computer Game in Linear Time. SmartCom 2016: 429-438 - [i8]Daxin Zhu, Lei Wang, Tinran Wang, Xiaodong Wang:
A simple linear space algorithm for computing a longest common increasing subsequence. CoRR abs/1608.07002 (2016) - 2015
- [c11]Daxin Zhu, Yingjie Wu, Xiaodong Wang:
An Efficient Algorithm for a Generalized LCS Problem. ICA3PP (4) 2015: 151-160 - [c10]Daxin Zhu, Lei Wang, Yingjie Wu, Xiaodong Wang:
An Efficient Dynamic Programming Algorithm for SEQ-IC-SEQ-EC-LCS Problem. ICA3PP (4) 2015: 814-821 - [c9]Daxin Zhu, Yingjie Wu, Xiaodong Wang:
A Dynamic Programming Algorithm for a Generalized LCS Problem with Multiple Subsequence Inclusion Constraints. IOV 2015: 439-446 - [i7]Daxin Zhu, Lei Wang, Yingjie Wu, Xiaodong Wang:
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints. CoRR abs/1505.06529 (2015) - [i6]Daxin Zhu, Lei Wang, Yingjie Wu, Xiaodong Wang:
An Efficient Dynamic Programming Algorithm for STR-IC-SEQ-EC-LCS Problem. CoRR abs/1506.00063 (2015) - [i5]Daxin Zhu, Lei Wang, Yingjie Wu, Xiaodong Wang:
A Practical O(Rlog log n+n) time Algorithm for Computing the Longest Common Subsequence. CoRR abs/1508.05553 (2015) - 2014
- [j7]Daxin Zhu, Xiaodong Wang:
An Optimal Algorithm for the Weighted Median Problem. J. Comput. 9(2): 257-265 (2014) - [j6]Daxin Zhu, Xiaodong Wang:
An Efficient Continued Fraction Algorithm for Nonlinear Optimization and Its Computer Implementation. J. Comput. 9(4): 883-890 (2014) - [j5]Yingjie Wu, Lei Wang, Daxin Zhu, Xiaodong Wang:
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints. J. Discrete Algorithms 26: 98-105 (2014) - [i4]Yingjie Wu, Daxin Zhu, Lei Wang, Xiaodong Wang:
A note on the largest number of red nodes in red-black trees. CoRR abs/1406.3092 (2014) - 2013
- [j4]Daxin Zhu, Xiaodong Wang:
A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint. Algorithms 6(3): 485-493 (2013) - [j3]Lei Wang, Xiaodong Wang, Yingjie Wu, Daxin Zhu:
A dynamic programming solution to a generalized LCS problem. Inf. Process. Lett. 113(19-21): 723-728 (2013) - [i3]Lei Wang, Xiaodong Wang, Yingjie Wu, Daxin Zhu:
A Dynamic Programming Solution to a Generalized LCS Problem. CoRR abs/1301.7183 (2013) - [i2]Lei Wang, Xiaodong Wang, Yingjie Wu, Daxin Zhu:
An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains. CoRR abs/1303.1872 (2013) - [i1]Lei Wang, Xiaodong Wang, Yingjie Wu, Daxin Zhu:
Complete Solutions for a Combinatorial Puzzle in Linear Time. CoRR abs/1307.4543 (2013) - 2011
- [c7]Xiaodong Wang, Daxin Zhu:
Efficient Solutions for a Problem in Currency Systems. AICI (1) 2011: 171-178
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-15 20:47 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:
