iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.org/pid/07/1021-3.rss
dblp: Xiaodong Wang https://dblp.org/pid/07/1021-3.html dblp person page RSS feed Mon, 25 Nov 2024 22:46:59 +0100 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Xiaodong Wanghttps://dblp.org/pid/07/1021-3.html14451 Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints.https://doi.org/10.1089/cmb.2019.0008, , :
Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints. J. Comput. Biol. 26(9): 938-947 ()]]>https://dblp.org/rec/journals/jcb/WangWZ19Tue, 01 Jan 2019 00:00:00 +0100 A note on the largest number of red nodes in red-black trees.https://doi.org/10.1016/j.jda.2017.03.001, , , :
A note on the largest number of red nodes in red-black trees. J. Discrete Algorithms 43: 81-94 ()]]>https://dblp.org/rec/journals/jda/ZhuW0W17Sun, 01 Jan 2017 00:00:00 +0100 A space efficient algorithm for the longest common subsequence in k-length substrings.https://doi.org/10.1016/j.tcs.2017.05.015, , , :
A space efficient algorithm for the longest common subsequence in k-length substrings. Theor. Comput. Sci. 687: 79-92 ()]]>https://dblp.org/rec/journals/tcs/ZhuWWW17Sun, 01 Jan 2017 00:00:00 +0100 A Space Efficient Algorithm for LCIS Problem.https://doi.org/10.1007/978-3-319-72389-1_6, :
A Space Efficient Algorithm for LCIS Problem. SpaCCS : 70-77]]>https://dblp.org/rec/conf/spaccs/ZhuW17Sun, 01 Jan 2017 00:00:00 +0100 Improving the Efficiency of Dynamic Programming in Big Data Computing.https://doi.org/10.1007/978-3-319-72389-1_7, :
Improving the Efficiency of Dynamic Programming in Big Data Computing. SpaCCS : 78-86]]>https://dblp.org/rec/conf/spaccs/WangZ17Sun, 01 Jan 2017 00:00:00 +0100 An Efficient Algorithm for a New Constrained LCS Problem.https://doi.org/10.1007/978-3-662-49390-8_25, , :
An Efficient Algorithm for a New Constrained LCS Problem. ACIIDS (2) : 261-267]]>https://dblp.org/rec/conf/aciids/ZhuWW16Fri, 01 Jan 2016 00:00:00 +0100 An Efficient Dynamic Programming Algorithm for STR-IC-STR-EC-LCS Problem.https://doi.org/10.1007/978-3-319-39077-2_1, , :
An Efficient Dynamic Programming Algorithm for STR-IC-STR-EC-LCS Problem. GPC : 3-17]]>https://dblp.org/rec/conf/gpc/ZhuWW16Fri, 01 Jan 2016 00:00:00 +0100 A Polynomial Time Algorithm for a Generalized Longest Common Subsequence Problem.https://doi.org/10.1007/978-3-319-39077-2_2, , :
A Polynomial Time Algorithm for a Generalized Longest Common Subsequence Problem. GPC : 18-29]]>https://dblp.org/rec/conf/gpc/WangWZ16Fri, 01 Jan 2016 00:00:00 +0100 A Novel Algorithm to Determine the Cutoff Score.https://doi.org/10.1007/978-3-319-48335-1_5, , :
A Novel Algorithm to Determine the Cutoff Score. HIS : 43-48]]>https://dblp.org/rec/conf/his2/WangTZ16Fri, 01 Jan 2016 00:00:00 +0100 On Determination of Balance Ratio for Some Tree Structures.https://doi.org/10.1007/978-3-319-47099-3_17, , :
On Determination of Balance Ratio for Some Tree Structures. NPC : 205-212]]>https://dblp.org/rec/conf/npc/ZhuWW16Fri, 01 Jan 2016 00:00:00 +0100 An Efficient Dynamic Programming Algorithm for STR-IC-STR-IC-LCS Problem.https://doi.org/10.1007/978-3-319-31750-2_37, , :
An Efficient Dynamic Programming Algorithm for STR-IC-STR-IC-LCS Problem. PAKDD (2) : 466-477]]>https://dblp.org/rec/conf/pakdd/ZhuWW16Fri, 01 Jan 2016 00:00:00 +0100 Efficient Computation for the Longest Common Subsequence with Substring Inclusion and Subsequence Exclusion Constraints.https://doi.org/10.1007/978-3-319-52015-5_43, :
Efficient Computation for the Longest Common Subsequence with Substring Inclusion and Subsequence Exclusion Constraints. SmartCom : 419-428]]>https://dblp.org/rec/conf/smartcom/WangZ16Fri, 01 Jan 2016 00:00:00 +0100 An Optimal Algorithm for a Computer Game in Linear Time.https://doi.org/10.1007/978-3-319-52015-5_44, :
An Optimal Algorithm for a Computer Game in Linear Time. SmartCom : 429-438]]>https://dblp.org/rec/conf/smartcom/ZhuW16Fri, 01 Jan 2016 00:00:00 +0100 A simple linear space algorithm for computing a longest common increasing subsequence.http://arxiv.org/abs/1608.07002, , , :
A simple linear space algorithm for computing a longest common increasing subsequence. CoRR abs/1608.07002 ()]]>https://dblp.org/rec/journals/corr/Zhu0WW16Fri, 01 Jan 2016 00:00:00 +0100 An Efficient Algorithm for a Generalized LCS Problem.https://doi.org/10.1007/978-3-319-27140-8_11, , :
An Efficient Algorithm for a Generalized LCS Problem. ICA3PP (4) : 151-160]]>https://dblp.org/rec/conf/ica3pp/ZhuWW15Thu, 01 Jan 2015 00:00:00 +0100 An Efficient Dynamic Programming Algorithm for SEQ-IC-SEQ-EC-LCS Problem.https://doi.org/10.1007/978-3-319-27140-8_56, , , :
An Efficient Dynamic Programming Algorithm for SEQ-IC-SEQ-EC-LCS Problem. ICA3PP (4) : 814-821]]>https://dblp.org/rec/conf/ica3pp/ZhuWWW15Thu, 01 Jan 2015 00:00:00 +0100 A Dynamic Programming Algorithm for a Generalized LCS Problem with Multiple Subsequence Inclusion Constraints.https://doi.org/10.1007/978-3-319-27293-1_38, , :
A Dynamic Programming Algorithm for a Generalized LCS Problem with Multiple Subsequence Inclusion Constraints. IOV : 439-446]]>https://dblp.org/rec/conf/iov/ZhuWW15Thu, 01 Jan 2015 00:00:00 +0100 An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints.http://arxiv.org/abs/1505.06529, , , :
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints. CoRR abs/1505.06529 ()]]>https://dblp.org/rec/journals/corr/ZhuWWW15Thu, 01 Jan 2015 00:00:00 +0100 An Efficient Dynamic Programming Algorithm for STR-IC-SEQ-EC-LCS Problem.http://arxiv.org/abs/1506.00063, , , :
An Efficient Dynamic Programming Algorithm for STR-IC-SEQ-EC-LCS Problem. CoRR abs/1506.00063 ()]]>https://dblp.org/rec/journals/corr/ZhuWWW15aThu, 01 Jan 2015 00:00:00 +0100 A Practical O(Rlog log n+n) time Algorithm for Computing the Longest Common Subsequence.http://arxiv.org/abs/1508.05553, , , :
A Practical O(Rlog log n+n) time Algorithm for Computing the Longest Common Subsequence. CoRR abs/1508.05553 ()]]>https://dblp.org/rec/journals/corr/ZhuWWW15bThu, 01 Jan 2015 00:00:00 +0100 An Optimal Algorithm for the Weighted Median Problem.http://www.jcomputers.us/index.php?m=content&c=index&a=show&catid=112&id=1572, :
An Optimal Algorithm for the Weighted Median Problem. J. Comput. 9(2): 257-265 ()]]>https://dblp.org/rec/journals/jcp/ZhuW14Wed, 01 Jan 2014 00:00:00 +0100 An Efficient Continued Fraction Algorithm for Nonlinear Optimization and Its Computer Implementation.http://www.jcomputers.us/index.php?m=content&c=index&a=show&catid=83&id=1126, :
An Efficient Continued Fraction Algorithm for Nonlinear Optimization and Its Computer Implementation. J. Comput. 9(4): 883-890 ()]]>https://dblp.org/rec/journals/jcp/ZhuW14aWed, 01 Jan 2014 00:00:00 +0100 An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints.https://doi.org/10.1016/j.jda.2014.01.005, , , :
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints. J. Discrete Algorithms 26: 98-105 ()]]>https://dblp.org/rec/journals/jda/WuWZW14Wed, 01 Jan 2014 00:00:00 +0100 A note on the largest number of red nodes in red-black trees.http://arxiv.org/abs/1406.3092, , , :
A note on the largest number of red nodes in red-black trees. CoRR abs/1406.3092 ()]]>https://dblp.org/rec/journals/corr/WuZWW14Wed, 01 Jan 2014 00:00:00 +0100 A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint.https://doi.org/10.3390/a6030485, :
A Simple Algorithm for Solving for the Generalized Longest Common Subsequence (LCS) Problem with a Substring Exclusion Constraint. Algorithms 6(3): 485-493 ()]]>https://dblp.org/rec/journals/algorithms/ZhuW13Tue, 01 Jan 2013 00:00:00 +0100 A dynamic programming solution to a generalized LCS problem.https://doi.org/10.1016/j.ipl.2013.07.005, , , :
A dynamic programming solution to a generalized LCS problem. Inf. Process. Lett. 113(19-21): 723-728 ()]]>https://dblp.org/rec/journals/ipl/WangWWZ13Tue, 01 Jan 2013 00:00:00 +0100 A Dynamic Programming Solution to a Generalized LCS Problem.http://arxiv.org/abs/1301.7183, , , :
A Dynamic Programming Solution to a Generalized LCS Problem. CoRR abs/1301.7183 ()]]>https://dblp.org/rec/journals/corr/abs-1301-7183Tue, 01 Jan 2013 00:00:00 +0100 An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains.http://arxiv.org/abs/1303.1872, , , :
An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains. CoRR abs/1303.1872 ()]]>https://dblp.org/rec/journals/corr/abs-1303-1872Tue, 01 Jan 2013 00:00:00 +0100 Complete Solutions for a Combinatorial Puzzle in Linear Time.http://arxiv.org/abs/1307.4543, , , :
Complete Solutions for a Combinatorial Puzzle in Linear Time. CoRR abs/1307.4543 ()]]>https://dblp.org/rec/journals/corr/WangWWZ13Tue, 01 Jan 2013 00:00:00 +0100 A Gene Selection Method for Cancer Classification.https://doi.org/10.1155/2012/586246, :
A Gene Selection Method for Cancer Classification. Comput. Math. Methods Medicine 2012: 586246:1-586246:5 ()]]>https://dblp.org/rec/journals/cmmm/WangT12Sun, 01 Jan 2012 00:00:00 +0100 Differential Privacy Data Release through Adding Noise on Average Value.https://doi.org/10.1007/978-3-642-34601-9_32, , :
Differential Privacy Data Release through Adding Noise on Average Value. NSS : 417-429]]>https://dblp.org/rec/conf/nss/ZhangWW12Sun, 01 Jan 2012 00:00:00 +0100 Efficient Solutions for a Problem in Currency Systems.https://doi.org/10.1007/978-3-642-23881-9_22, :
Efficient Solutions for a Problem in Currency Systems. AICI (1) : 171-178]]>https://dblp.org/rec/conf/aici/WangZ11aSat, 01 Jan 2011 00:00:00 +0100 Utility-based k-anonymization.https://ieeexplore.ieee.org/document/5573166/, , , :
Utility-based k-anonymization. NCM : 318-323]]>https://dblp.org/rec/conf/ncm/TangWLW10Fri, 01 Jan 2010 00:00:00 +0100 Speeding up the Algorithms for the Subset-Sum Problem with the Bitset Class.https://dblp.org/pid/07/1021-3.html, , :
Speeding up the Algorithms for the Subset-Sum Problem with the Bitset Class. Software Engineering Research and Practice : 305-309]]>https://dblp.org/rec/conf/serp/WangWW10Fri, 01 Jan 2010 00:00:00 +0100 An Optimal Algorithm for Prufer Codes.https://doi.org/10.4236/jsea.2009.22016, , :
An Optimal Algorithm for Prufer Codes. J. Softw. Eng. Appl. 2(2): 111-115 ()]]>https://dblp.org/rec/journals/jsea/WangWW09Thu, 01 Jan 2009 00:00:00 +0100 Privacy Preserving k-Anonymity for Re-publication of Incremental Datasets.https://doi.org/10.1109/CSIE.2009.549, , :
Privacy Preserving k-Anonymity for Re-publication of Incremental Datasets. CSIE (4) : 53-60]]>https://dblp.org/rec/conf/csie/WuSW09Thu, 01 Jan 2009 00:00:00 +0100 An Optimal Algorithm for Neville Codes of a Tree Network.https://doi.org/10.1109/MSN.2009.22, , :
An Optimal Algorithm for Neville Codes of a Tree Network. MSN : 420-423]]>https://dblp.org/rec/conf/msn/WuCW09Thu, 01 Jan 2009 00:00:00 +0100 An Efficient Algorithm for the Longest Pattern Subsequence Problem.https://dblp.org/pid/07/1021-3.html, , :
An Efficient Algorithm for the Longest Pattern Subsequence Problem. BIOCOMP : 9-14]]>https://dblp.org/rec/conf/biocomp/WangWW08Tue, 01 Jan 2008 00:00:00 +0100 A Linear Time Algorithm for Coding and Decoding Neville Codes.https://dblp.org/pid/07/1021-3.html, :
A Linear Time Algorithm for Coding and Decoding Neville Codes. Communications in Computing : 65-69]]>https://dblp.org/rec/conf/cic/WangW08Tue, 01 Jan 2008 00:00:00 +0100