![]() | 2009 | |
---|---|---|
273 | ![]() ![]() ![]() ![]() ![]() ![]() | Jie Shi, Hong Zhu, Ge Fu, Tao Jiang: On the Soundness Property for SQL Queries of Fine-grained Access Control in DBMSs. ACIS-ICIS 2009: 469-474 |
272 | ![]() ![]() ![]() ![]() ![]() ![]() | Wei-Bung Wang, Tao Jiang: Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract). CPM 2009: 353-367 |
271 | ![]() ![]() ![]() ![]() ![]() ![]() | Yong-sheng Li, Wei-li Wang, Yong-jun Qiao, Tao Jiang: Evaluation on the Anti-ship Missile Penetration Ability of the Aircraft Carrier Formation Based on Queuing Theory. CSO (1) 2009: 427-429 |
270 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: Asymptotic Behavior of Ruin Probability in Insurance Risk Model with Large Claims. Complex (1) 2009: 1033-1043 |
269 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: Finite Time Ruin Probability in Non-standard Risk Model with Risky Investments. Complex (2) 2009: 1783-1793 |
268 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Qiu, Jie Chen, Xue Cao: LILA: A Connected Components Labeling Algorithm in Grid-Based Clustering. DBTA 2009: 213-216 |
267 | ![]() ![]() ![]() ![]() ![]() ![]() | Jing Xiao, Tiancheng Lou, Tao Jiang: An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract). ESA 2009: 325-336 |
266 | ![]() ![]() ![]() ![]() ![]() ![]() | Yun Li, Bin Cao, Chonggang Wang, Xiaohu You, Ali Daneshmand, Hongcheng Zhuang, Tao Jiang: Dynamical Cooperative MAC Based on Optimal Selection of Multiple Helpers. GLOBECOM 2009: 1-6 |
265 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Liu Xin: Adaptive Meshfree Method Based on Local Thin Plate Spline Radial Basis Interpolation for the Solution of High Gradient Problems. ICNC (3) 2009: 410-414 |
264 | ![]() ![]() ![]() ![]() ![]() ![]() | Jingling Yuan, Tao Jiang, Jingjing He, Luo Zhong: Grey Neural Network Based Predictive Model for Multi-core Architecture 2D Spatial Characteristics. ISNN (1) 2009: 887-892 |
263 | ![]() ![]() ![]() ![]() ![]() ![]() | Kui Zhang, Qian Zhang, Tao Jiang, Peng Guo: A navigation system based on a sensor network without exit and locations. SenSys 2009: 311-312 |
262 | ![]() ![]() ![]() ![]() ![]() ![]() | Minghui Wu, Fanwei Zhu, Jia Lv, Tao Jiang, Jing Ying: Improve Semantic Web Services Discovery through Similarity Search in Metric Space. TASE 2009: 297-298 |
261 | ![]() ![]() ![]() ![]() ![]() ![]() | Dandan Song, Yang Yang, Bin Yu, Binglian Zheng, Zhidong Deng, Bao-Liang Lu, Xuemei Chen, Tao Jiang: Computational prediction of novel non-coding RNAs in Arabidopsis thaliana. BMC Bioinformatics 10(S-1): (2009) |
260 | ![]() ![]() ![]() ![]() ![]() ![]() | Xiangming Li, Tao Jiang, Qian Zhang, Lan Wang: Binary linear multicast network coding on acyclic networks: principles and applications in wireless communication networks. IEEE Journal on Selected Areas in Communications 27(5): 738-748 (2009) |
259 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ah-Hwee Tan: Learning Image-Text Associations. IEEE Trans. Knowl. Data Eng. 21(2): 161-177 (2009) |
258 | ![]() ![]() ![]() ![]() ![]() ![]() | Ying Xu, Ming Li, Tao Jiang: Preface. J. Comput. Sci. Technol. 25(1): 1-2 (2009) |
257 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: Some Algorithmic Challenges in Genome-Wide Ortholog Assignment. J. Comput. Sci. Technol. 25(1): 42-52 (2009) |
256 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Yucai Feng, Bing Zhang: Online Detecting and Predicting Special Patterns over Financial Data Streams. J. UCS 15(13): 2566-2585 (2009) |
255 | ![]() ![]() ![]() ![]() ![]() ![]() | Jing Xiao, Lan Liu, Lirong Xia, Tao Jiang: Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigree Based on Fast Elimination of Redundant Linear Equations. SIAM J. Comput. 38(6): 2198-2219 (2009) |
254 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Zevi Miller, Dan Pritikin: Separation numbers of trees. Theor. Comput. Sci. 410(38-40): 3769-3781 (2009) |
2008 | ||
253 | ![]() ![]() ![]() ![]() ![]() ![]() | Jing Xiao, Lusheng Wang, Xiaowen Liu, Tao Jiang: Finding Additive Biclusters with Random Background. CPM 2008: 263-276 |
252 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Jing Ying, Minghui Wu, Canghong Jin: A method for model-driven development of adaptive web applications. CSCWD 2008: 386-391 |
251 | ![]() ![]() ![]() ![]() ![]() ![]() | Canghong Jin, Minghui Wu, Tao Jiang, Jing Ying: Combine automatic and manual process on web service selection and composition to support QoS. CSCWD 2008: 459-464 |
250 | ![]() ![]() ![]() ![]() ![]() ![]() | Anlin Wang, Liang Hu, Yingchao Fu, Tao Jiang, Guangjun Liu: Failure Model of Fretting Wear Based on Self-Organizing Method. FSKD (4) 2008: 565-569 |
249 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, John S. Baras: Trust Credential Distribution in Autonomic Networks. GLOBECOM 2008: 1974-1978 |
248 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhiqiang Wang, Daiming Qu, Tao Jiang, Yejun He: Spectral Sculpting for OFDM Based Opportunistic Spectrum Access by Extended Active Interference Cancellation. GLOBECOM 2008: 4442-4446 |
247 | ![]() ![]() ![]() ![]() ![]() ![]() | Yucai Feng, Tao Jiang, Yingbiao Zhou, Junkui Li: An Efficient Similarity Searching Algorithm Based on Clustering for Time Series. ICDM 2008: 360-373 |
246 | ![]() ![]() ![]() ![]() ![]() ![]() | Jinjun Li, Hong Zhao, Tao Jiang, Xiang Zhou: Development of a 3D High-Precise Positioning System Based on a Planar Target and Two CCD Cameras. ICIRA (2) 2008: 475-484 |
245 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Yucai Feng, Bin Zhang, Jie Shi, Yuanzhen Wang: Finding Motifs of Financial Data Streams in Real Time. ISICA 2008: 546-555 |
244 | ![]() ![]() ![]() ![]() ![]() ![]() | Yiqun Cao, Tao Jiang, Thomas Girke: A maximum common substructure-based algorithm for searching and predicting drug-like compounds. ISMB 2008: 366-374 |
243 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Mark Harman, Youssef Hassoun: Analysis of Procedure Splitability. WCRE 2008: 247-256 |
242 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Daiming Qu: On minimum sensing error with spectrum sensing using counting rule in cognitive radio networks. WICON 2008: 62 |
241 | ![]() ![]() ![]() ![]() ![]() ![]() | Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang: Nearest Neighbor Interchange and Related Distances. Encyclopedia of Algorithms 2008 |
240 | ![]() ![]() ![]() ![]() ![]() ![]() | Xin Chen, Lan Liu, Zheng Liu, Tao Jiang: On the minimum common integer partition problem. ACM Transactions on Algorithms 5(1): (2008) |
239 | ![]() ![]() ![]() ![]() ![]() ![]() | Yiqun Cao, Anna Charisi, Li-Chang Cheng, Tao Jiang, Thomas Girke: ChemmineR: a compound mining framework for R. Bioinformatics 24(15): 1733-1734 (2008) |
238 | ![]() ![]() ![]() ![]() ![]() ![]() | Xin Chen, Lingqiong Guo, Zhaocheng Fan, Tao Jiang: W-AlignACE: an improved Gibbs sampling algorithm based on more accurate position weight matrices learned from sequence and gene expression/ChIP-chip data. Bioinformatics 24(9): 1121-1128 (2008) |
237 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Mohsen Guizani, Hsiao-Hwa Chen, Weidong Xiang, Yiyan Wu: Derivation of PAPR Distribution for OFDM Wireless Systems Based on Extreme Value Theory. IEEE Transactions on Wireless Communications 7(4): 1298-1305 (2008) |
236 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Luo, Tao Jiang, Weidong Xiang, Hsiao-Hwa Chen: A Subcarriers Allocation Scheme for Cognitive Radio Systems Based on Multi-Carrier Modulation. IEEE Transactions on Wireless Communications 7(9): 3335-3340 (2008) |
235 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Nicolas Gold, Mark Harman, Zheng Li: Locating dependence structures using search-based slicing. Information & Software Technology 50(12): 1189-1209 (2008) |
234 | ![]() ![]() ![]() ![]() ![]() ![]() | Jing Li, Tao Jiang: A Survey on Haplotyping Algorithms for Tightly Linked Markers. J. Bioinformatics and Computational Biology 6(1): 241-259 (2008) |
233 | ![]() ![]() ![]() ![]() ![]() ![]() | Zheng Fu, Tao Jiang: Clustering of Main orthologs for Multiple genomes. J. Bioinformatics and Computational Biology 6(3): 573-584 (2008) |
232 | ![]() ![]() ![]() ![]() ![]() ![]() | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Tao Jiang: On the Approximation of Correlation Clustering and Consensus Clustering. J. Comput. Syst. Sci. 74(5): 671-696 (2008) |
231 | ![]() ![]() ![]() ![]() ![]() ![]() | Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson: Approximate clustering of incomplete fingerprints. J. Discrete Algorithms 6(1): 103-108 (2008) |
230 | ![]() ![]() ![]() ![]() ![]() ![]() | Jing Xiao, Lusheng Wang, Xiaowen Liu, Tao Jiang: An Efficient Voting Algorithm for Finding Additive Biclusters with Random Background. Journal of Computational Biology 15(10): 1275-1293 (2008) |
229 | ![]() ![]() ![]() ![]() ![]() ![]() | Reza Akhtar, Tao Jiang, Zevi Miller: Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs. SIAM J. Discrete Math. 22(2): 425-449 (2008) |
228 | ![]() ![]() ![]() ![]() ![]() ![]() | Peng Guo, Tao Jiang, Guangxi Zhu, Hsiao-Hwa Chen: Utilizing acoustic propagation delay to design MAC protocols for underwater wireless sensor networks. Wireless Communications and Mobile Computing 8(8): 1035-1044 (2008) |
2007 | ||
227 | ![]() ![]() ![]() ![]() ![]() ![]() | Zheng Fu, Tao Jiang: Computing the Breakpoint Distance between Partially Ordered Genomes. APBC 2007: 237-246 |
226 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search. CPM 2007: 1 |
225 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Helen J. Wang, Yih-Chun Hu: Preserving location privacy in wireless lans. MobiSys 2007: 246-257 |
224 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Khashayar Khorasani: A fault detection, isolation and reconstruction strategy for a satellite's attitude control subsystem with redundant reaction wheels. SMC 2007: 3146-3152 |
223 | ![]() ![]() ![]() ![]() ![]() ![]() | Jing Xiao, Lan Liu, Lirong Xia, Tao Jiang: Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree. SODA 2007: 655-664 |
222 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Luo, Weidong Xiang, Tao Jiang, Zhigang Wen: Maximum Likelihood Ratio Spectrum Detection Model for Multicarrier Modulation Based Cognitive Radio Systems. VTC Fall 2007: 1698-1701 |
221 | ![]() ![]() ![]() ![]() ![]() ![]() | Reza Akhtar, Tao Jiang, Dan Pritikin: Edge-Bandwidth of the Triangular Grid. Electr. J. Comb. 14(1): (2007) |
220 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ah-Hwee Tan, Ke Wang: Mining Generalized Associations of Semantic Relations from Textual Web Content. IEEE Trans. Knowl. Data Eng. 19(2): 164-179 (2007) |
219 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Weidong Xiang, P. C. Richardson, Daiming Qu, Guangxi Zhu: On the Nonlinear Companding Transform for Reduction in PAPR of MCM Signals. IEEE Transactions on Wireless Communications 6(6): 2017-2021 (2007) |
218 | ![]() ![]() ![]() ![]() ![]() ![]() | Brendan Lucier, Tao Jiang, Ming Li: Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility. Inf. Process. Lett. 103(2): 45-51 (2007) |
217 | ![]() ![]() ![]() ![]() ![]() ![]() | Zheng Fu, Tao Jiang: Computing the Breakpoint Distance between Partially Ordered genomes. J. Bioinformatics and Computational Biology 5(5): 1087-1101 (2007) |
216 | ![]() ![]() ![]() ![]() ![]() ![]() | Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang Zhong, Tao Jiang: MSOAR: A High-Throughput Ortholog Assignment System Based on Genome Rearrangement. Journal of Computational Biology 14(9): 1160-1175 (2007) |
215 | ![]() ![]() ![]() ![]() ![]() ![]() | Lan Liu, Chen Xi, Jing Xiao, Tao Jiang: Complexity and approximation of the minimum recombinant haplotype configuration problem. Theor. Comput. Sci. 378(3): 316-330 (2007) |
2006 | ||
214 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ueng-Cheng Yang, Yi-Ping Phoebe Chen, Limsoon Wong: Proceedings of 4th Asia-Pacific Bioinformatics Conference. 13-16 February 2006, Taipei, Taiwan Imperial College Press, London 2006 |
213 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ueng-Cheng Yang, Yi-Ping Phoebe Chen, Limsoon Wong: Preface. APBC 2006 |
212 | ![]() ![]() ![]() ![]() ![]() ![]() | Xin Chen, Lan Liu, Zheng Liu, Tao Jiang: On the Minimum Common Integer Partition Problem. CIAC 2006: 236-247 |
211 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Jing Ying, Minghui Wu, Min Fang: An Architecture of Process-centered Context-aware Software Development Environment. CSCWD 2006: 426-430 |
210 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Jing Ying, Minghui Wu: CASDE: An Environment for Collaborative Software Development. CSCWD (Selected Papers) 2006: 367-376 |
209 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ah-Hwee Tan: Mining RDF Metadata for Generalized Association Rules. DEXA 2006: 223-233 |
208 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Kejie Lu, Dapeng Wu, Guangxi Zhu: On The Uniform Companding Transform for Reducing PAPR of MCM Signals. GLOBECOM 2006 |
207 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, John S. Baras: Trust Evaluation in Anarchy: A Case Study on Autonomous Networks. INFOCOM 2006 |
206 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Zixiao Li, Shouwei Li, Shaowu Li, Zhong Zhang: Role of 3T High Field BOLD fMRI in Brain Cortical Mapping for Glioma Involving Eloquent Areas. MIAR 2006: 92-99 |
205 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ah-Hwee Tan: Discovering Image-Text Associations for Cross-Media Web Information Fusion. PKDD 2006: 561-568 |
204 | ![]() ![]() ![]() ![]() ![]() ![]() | Zheng Fu, Xin Chen, Vladimir Vacic, Peng Nan, Yang Zhong, Tao Jiang: A Parsimony Approach to Genome-Wide Ortholog Assignment. RECOMB 2006: 578-594 |
203 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ah-Hwee Tan: Mining RDF metadata for generalized association rules: knowledge discovery in the semantic web era. WWW 2006: 951-952 |
202 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: Disproof of a conjecture about average Steiner distance. Ars Comb. 79: (2006) |
201 | ![]() ![]() ![]() ![]() ![]() ![]() | Jie Zheng, Jan T. Svensson, Kavitha Madishetty, Timothy J. Close, Tao Jiang, Stefano Lonardi: OligoSpawn: a software tool for the design of overgo probes from large unigene datasets. BMC Bioinformatics 7: 7 (2006) |
200 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, R. D. (Shawn) Blanton: Inductive fault analysis of surface-micromachined MEMS. IEEE Trans. on CAD of Integrated Circuits and Systems 25(6): 1104-1116 (2006) |
199 | ![]() ![]() ![]() ![]() ![]() ![]() | Haifeng Li, Tao Jiang, Keshu Zhang: Efficient and robust feature extraction by maximum margin criterion. IEEE Transactions on Neural Networks 17(1): 157-165 (2006) |
198 | ![]() ![]() ![]() ![]() ![]() ![]() | Daiming Qu, Guangxi Zhu, Tao Jiang: Training Sequence Design and Parameter Estimation of MIMO Channels with Carrier Frequency Offsets. IEEE Transactions on Wireless Communications 5(12): 3662-3666 (2006) |
197 | ![]() ![]() ![]() ![]() ![]() ![]() | Haifeng Li, Xin Chen, Keshu Zhang, Tao Jiang: A General Framework for Biclustering Gene Expression Data. J. Bioinformatics and Computational Biology 4(4): 911-993 (2006) |
196 | ![]() ![]() ![]() ![]() ![]() ![]() | Yong Zhang, Qi Ge, Rudolf Fleischer, Tao Jiang, Hong Zhu: Approximating the minimum weight weak vertex cover. Theor. Comput. Sci. 363(1): 99-105 (2006) |
195 | ![]() ![]() ![]() ![]() ![]() ![]() | Wenbo Zhao, Peng Zhang, Tao Jiang: A network flow approach to the Minimum Common Integer Partition Problem. Theor. Comput. Sci. 369(1-3): 456-462 (2006) |
2005 | ||
194 | ![]() ![]() ![]() ![]() ![]() ![]() | Haifeng Li, Keshu Zhang, Tao Jiang: The Regularized EM Algorithm. AAAI 2005: 807-812 |
193 | ![]() ![]() ![]() ![]() ![]() ![]() | Xin Chen, Jie Zheng, Zheng Fu, Peng Nan, Yang Zhong, Stefano Lonardi, Tao Jiang: Computing the Assignment of Orthologous Genes via Genome Rearrangement. APBC 2005: 363-378 |
192 | ![]() ![]() ![]() ![]() ![]() ![]() | Andres Figueroa, Avraham Goldstein, Tao Jiang, Maciej Kurowski, Andrzej Lingas, Mia Persson: Approximate Clustering of Fingerprint Vectors with Missing Values. CATS 2005: 57-60 |
191 | ![]() ![]() ![]() ![]() ![]() ![]() | Zheng Liu, Xin Chen, James Borneman, Tao Jiang: A Fast Algorithm for Approximate String Matching on Gene Sequences. CPM 2005: 79-90 |
190 | ![]() ![]() ![]() ![]() ![]() ![]() | Haifeng Li, Keshu Zhang, Tao Jiang: Robust and Accurate Cancer Classification with Gene Expression Profiling. CSB 2005: 310-321 |
189 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Wonil Kim, Kyung-suk Lhee, Manpyo Hong: E-mail Worm Detection Using the Analysis of Behavior. ICDCIT 2005: 348-356 |
188 | ![]() ![]() ![]() ![]() ![]() ![]() | Jinbo Qiu, Guangxi Zhu, Tao Jiang: An Adaptive Cross Layer Unequal Protection Method for Video Transmission over Wireless Communication Channels. ICESS 2005: 452-461 |
187 | ![]() ![]() ![]() ![]() ![]() ![]() | Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Tao Jiang: Correlation Clustering and Consensus Clustering. ISAAC 2005: 226-235 |
186 | ![]() ![]() ![]() ![]() ![]() ![]() | Lan Liu, Xi Chen, Jing Xiao, Tao Jiang: Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem. ISAAC 2005: 370-379 |
185 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Xingzhou Jiang: Locally Spatiotemporal Saliency Representation: The Role of Independent Component Analysis. ISNN (1) 2005: 997-1003 |
184 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhongchao Yu, Chuk-Yang Seng, Tao Jiang, Xue Wu, William A. Arbaugh: Robust Routing in Malicious Environment for Ad Hoc Networks. ISPEC 2005: 36-47 |
183 | ![]() ![]() ![]() ![]() ![]() ![]() | Jing Li, Tao Jiang: Haplotype-based linkage disequilibrium mapping via direct data mining. Bioinformatics 21(24): 4384-4393 (2005) |
182 | ![]() ![]() ![]() ![]() ![]() ![]() | M. Carmen Hernando, Tao Jiang, Mercè Mora, Ignacio M. Pelayo, Carlos Seara: On the Steiner, geodetic and hull numbers of graphs. Discrete Mathematics 293(1-3): 139-154 (2005) |
181 | ![]() ![]() ![]() ![]() ![]() ![]() | Xin Chen, Jie Zheng, Zheng Fu, Peng Nan, Yang Zhong, Stefano Lonardi, Tao Jiang: Assignment of Orthologous Genes via Genome Rearrangement. IEEE/ACM Trans. Comput. Biology Bioinform. 2(4): 302-315 (2005) |
180 | ![]() ![]() ![]() ![]() ![]() ![]() | Zheng Liu, James Borneman, Tao Jiang: A software system for gene sequence database construction based on fast approximate string matching. IJBRA 1(3): 273-291 (2005) |
179 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhi-Zhong Chen, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu, Ying Xu, Tao Jiang: More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. Journal of Computational Biology 12(2): 129-146 (2005) |
178 | ![]() ![]() ![]() ![]() ![]() ![]() | Haifeng Li, Tao Jiang: A Class of Edit Kernels for SVMs to Predict Translation Initiation Sites in Eukaryotic mRNAs. Journal of Computational Biology 12(6): 702-718 (2005) |
177 | ![]() ![]() ![]() ![]() ![]() ![]() | Jing Li, Tao Jiang: Computing the Minimum Recombinant Haplotype Configuration from Incomplete Genotype Data on a Pedigree by Integer Linear Programming. Journal of Computational Biology 12(6): 719-739 (2005) |
2004 | ||
176 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Eric Pettus, Daksh Lehther: A mixed-mode extraction flow for high performance microprocessors. ASP-DAC 2004: 697-701 |
175 | ![]() ![]() ![]() ![]() ![]() ![]() | Haifeng Li, Keshu Zhang, Tao Jiang: Minimum Entropy Clustering and Applications to Gene Expression Analysis. CSB 2004: 142-151 |
174 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhengchang Su, PhuongAn Dam, X. Chen, Victor Olman, Tao Jiang, Ying Xu: Computational Construction of Nitrogen Assimilation Pathway in Cyanobacteria Synechococcus sp. WH8102. CSB 2004: 640-641 |
173 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, John S. Baras: Ant-Based Adaptive Trust Evidence Distribution in MANET. ICDCS Workshops 2004: 588-593 |
172 | ![]() ![]() ![]() ![]() ![]() ![]() | Jing Li, Tao Jiang: An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming. RECOMB 2004: 20-29 |
171 | ![]() ![]() ![]() ![]() ![]() ![]() | Haifeng Li, Tao Jiang: A class of edit kernels for SVMs to predict translation initiation sites in eukaryotic mRNAs. RECOMB 2004: 262-271 |
170 | ![]() ![]() ![]() ![]() ![]() ![]() | Maria Axenovich, Tao Jiang: Anti-Ramsey numbers for small complete bipartite graphs. Ars Comb. 73: (2004) |
169 | ![]() ![]() ![]() ![]() ![]() ![]() | Jie Zheng, Timothy J. Close, Tao Jiang, Stefano Lonardi: Efficient selection of unique and popular oligos for large EST databases. Bioinformatics 20(13): 2101-2112 (2004) |
168 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Douglas B. West: Edge-colorings of complete graphs that avoid polychromatic trees. Discrete Mathematics 274(1-3): 137-145 (2004) |
167 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Alexander Vardy: Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Binary Codes. IEEE Transactions on Information Theory 50(8): 1655-1664 (2004) |
166 | ![]() ![]() ![]() ![]() ![]() ![]() | Jonathan H. Badger, Paul E. Kearney, Ming Li, John Tsang, Tao Jiang: Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme. J. Algorithms 51(1): 1-14 (2004) |
165 | ![]() ![]() ![]() ![]() ![]() ![]() | Guohui Lin, Tao Jiang: A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition. J. Comb. Optim. 8(2): 183-194 (2004) |
164 | ![]() ![]() ![]() ![]() ![]() ![]() | Paola Bonizzoni, Gianluca Della Vedova, Tao Jiang: Foreword - Special Issue on Bioinformatics. J. Comput. Sci. Technol. 19(1): 1 (2004) |
163 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang: The longest common subsequence problem for arc-annotated sequences. J. Discrete Algorithms 2(2): 257-270 (2004) |
162 | ![]() ![]() ![]() ![]() ![]() ![]() | Andres Figueroa, James Borneman, Tao Jiang: Clustering Binary Fingerprint Vectors with Missing Values for DNA Array Data Analysis. Journal of Computational Biology 11(5): 887-901 (2004) |
161 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: A note on a conjecture about cycles with many incident chords. Journal of Graph Theory 46(3): 180-182 (2004) |
160 | ![]() ![]() ![]() ![]() ![]() ![]() | Maria Axenovich, Tao Jiang, André Kündgen: Bipartite anti-Ramsey numbers of cycles. Journal of Graph Theory 47(1): 9-28 (2004) |
2003 | ||
159 | ![]() ![]() ![]() ![]() ![]() ![]() | Jie Zheng, Timothy J. Close, Tao Jiang, Stefano Lonardi: Efficient Selection of Unique and Popular Oligos for Large EST Databases. CPM 2003: 384-401 |
158 | ![]() ![]() ![]() ![]() ![]() ![]() | Andres Figueroa, James Borneman, Tao Jiang: Clustering Binary Fingerprint Vectors with Missing Values for DNA Array Data Analysis. CSB 2003: 38-47 |
157 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhengchang Su, PhuongAn Dam, X. Chen, Victor Olman, Tao Jiang, B. Palenik, Ying Xu: Computational Inference of Regulatory Pathways in Microbes. CSB 2003: 631-633 |
156 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhi-Zhong Chen, Tao Jiang, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu, Ying Xu: More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. ESA 2003: 580-592 |
155 | ![]() ![]() ![]() ![]() ![]() ![]() | Jing Li, Chris Benner, Tao Jiang, Yingyao Zhou: Statistical Validation of Compound Structure-Selectivity Relationship Using NCI Cancer Database. METMBS 2003: 146-151 |
154 | ![]() ![]() ![]() ![]() ![]() ![]() | Haifeng Li, Tao Jiang, Keshu Zhang: Efficient and Robust Feature Extraction by Maximum Margin Criterion. NIPS 2003 |
153 | ![]() ![]() ![]() ![]() ![]() ![]() | Jing Li, Tao Jiang: Efficient rule-based haplotyping algorithms for pedigree data. RECOMB 2003: 197-206 |
152 | ![]() ![]() ![]() ![]() ![]() ![]() | Koichiro Doi, Jing Li, Tao Jiang: Minimum Recombiant Haplotype Configuration on Tree Pedigrees. WABI 2003: 339-353 |
151 | ![]() ![]() ![]() ![]() ![]() ![]() | Yaw-Ling Lin, Xiaoqiu Huang, Tao Jiang, Kun-Mao Chao: MAVG: locating non-overlapping maximum average segments in a given sequence. Bioinformatics 19(1): 151-152 (2003) |
150 | ![]() ![]() ![]() ![]() ![]() ![]() | Maria Axenovich, Tao Jiang, Zsolt Tuza: Local Anti-Ramsey Numbers of Graphs. Combinatorics, Probability & Computing 12(5-6): 495-511 (2003) |
149 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Douglas B. West: On the Erdos-Simonovits-So's Conjecture about the Anti-Ramsey Number of a Cycle. Combinatorics, Probability & Computing 12(5-6): 585-598 (2003) |
148 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhengrong Liu, Zhiyan Yang, Tao Jiang: The Same Distribution of Limit Cycles in Five perturbed cubic Hamiltonian Systems. I. J. Bifurcation and Chaos 13(1): 243-249 (2003) |
147 | ![]() ![]() ![]() ![]() ![]() ![]() | Jing Li, Tao Jiang: Efficient Inference of Haplotypes from Genotypes on a Pedigree. J. Bioinformatics and Computational Biology 1(1): 41-70 (2003) |
146 | ![]() ![]() ![]() ![]() ![]() ![]() | Guohui Lin, Dong Xu, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen, Ying Xu: Computational Assignment of Protein Backbone Nmr Peaks Byefficient Bounding and Filtering. J. Bioinformatics and Computational Biology 1(2): 387-410 (2003) |
145 | ![]() ![]() ![]() ![]() ![]() ![]() | Eric Bach, Joan Boyar, Leah Epstein, Lene M. Favrholdt, Tao Jiang, Kim S. Larsen, Guo-Hui Lin, Rob van Stee: Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. J. Scheduling 6(2): 131-147 (2003) |
144 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Art B. Owen: Quasi-regression with shrinkage. Mathematics and Computers in Simulation 62(3-6): 231-241 (2003) |
143 | ![]() ![]() ![]() ![]() ![]() ![]() | Noga Alon, Tao Jiang, Zevi Miller, Dan Pritikin: Properly colored subgraphs and rainbow subgraphs in edge-colorings with local constraints. Random Struct. Algorithms 23(4): 409-433 (2003) |
142 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhi-Zhong Chen, Tao Jiang, Guohui Lin: Computing Phylogenetic Roots with Bounded Degrees and Errors. SIAM J. Comput. 32(4): 864-879 (2003) |
141 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin, Jianjun Wen, Dong Xu, Jinbo Xu, Ying Xu: Approximation algorithms for NMR spectral peak assignment. Theor. Comput. Sci. 1-3(299): 211-229 (2003) |
2002 | ||
140 | ![]() ![]() ![]() ![]() ![]() ![]() | Guo-Hui Lin, Dong Xu, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen, Ying Xu: An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks. CSB 2002: 165-174 |
139 | ![]() ![]() ![]() ![]() ![]() ![]() | Kyle Ellrott, Chuhu Yang, Frances M. Sladek, Tao Jiang: Identifying transcription factor binding sites through Markov chain optimization. ECCB 2002: 100-109 |
138 | ![]() ![]() ![]() ![]() ![]() ![]() | Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao: Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis. MFCS 2002: 459-470 |
137 | ![]() ![]() ![]() ![]() ![]() ![]() | Gianluca Della Vedova, Tao Jiang, Jing Li, Jianjun Wen: Approximating minimum quartet inconsistency (abstract). SODA 2002: 894-895 |
136 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin, Jianjun Wen, Dong Xu, Ying Xu: Improved Approximation Algorithms for NMR Spectral Peak Assignment. WABI 2002: 82-96 |
135 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: Planar Hamiltonian chordal graphs are cycle extendable. Discrete Mathematics 257(2-3): 441-444 (2002) |
134 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Douglas B. West: Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees. Electronic Notes in Discrete Mathematics 11: 376-385 (2002) |
133 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: Edge-Colorings with No Large Polychromatic Stars. Graphs and Combinatorics 18(2): 303-308 (2002) |
132 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West: The Chromatic Spectrum of Mixed Hypergraphs. Graphs and Combinatorics 18(2): 309-318 (2002) |
131 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: Anti-Ramsey Numbers of Subdivided Graphs. J. Comb. Theory, Ser. B 85(2): 361-366 (2002) |
130 | ![]() ![]() ![]() ![]() ![]() ![]() | Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen: The longest common subsequence problem for sequences with nested arc annotations. J. Comput. Syst. Sci. 65(3): 465-480 (2002) |
129 | ![]() ![]() ![]() ![]() ![]() ![]() | Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao: Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. J. Comput. Syst. Sci. 65(3): 570-586 (2002) |
128 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang: A General Edit Distance between RNA Structures. Journal of Computational Biology 9(2): 371-388 (2002) |
127 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li, Paul M. B. Vitányi: The average-case area of Heilbronn-type triangles. Random Struct. Algorithms 20(2): 206-219 (2002) |
2001 | ||
126 | ![]() ![]() ![]() ![]() ![]() ![]() | Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen: The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations. ICALP 2001: 444-455 |
125 | ![]() ![]() ![]() ![]() ![]() ![]() | James Borneman, Marek Chrobak, Gianluca Della Vedova, Andres Figueroa, Tao Jiang: Probe selection algorithms with applications in the analysis of microbial communities. ISMB (Supplement of Bioinformatics) 2001: 39-48 |
124 | ![]() ![]() ![]() ![]() ![]() ![]() | Ezekiel F. Adebiyi, Tao Jiang, Michael Kaufmann: An efficient algorithm for finding short approximate non-tandem repeats. ISMB (Supplement of Bioinformatics) 2001: 5-12 |
123 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhi-Zhong Chen, Tao Jiang, Guo-Hui Lin: Computing Phylogenetic Roots with Bounded Degrees and Errors. WADS 2001: 377-388 |
122 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: Short Even Cycles In Cages With Odd Girth. Ars Comb. 59: (2001) |
121 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi: Two heads are better than two tapes CoRR cs.CC/0110039: (2001) |
120 | ![]() ![]() ![]() ![]() ![]() ![]() | Peng Zhao, Tao Jiang: A Heuristic Algorithm for Multiple Sequence Alignment Based on Blocks. J. Comb. Optim. 5(1): 95-115 (2001) |
119 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: On a Conjecture about Trees in Graphs with Large Girth. J. Comb. Theory, Ser. B 83(2): 221-232 (2001) |
2000 | ||
118 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Peng Zhao: A Heurestic Algorithm for Blocked Multiple Sequence Alignment. BIBE 2000: 176-183 |
117 | ![]() ![]() ![]() ![]() ![]() ![]() | Eric Bach, Joan Boyar, Tao Jiang, Kim S. Larsen, Guo-Hui Lin: Better Bounds on the Accommodating Ratio for the Seat Reservation Problem. COCOON 2000: 221-231 |
116 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang: The Longest Common Subsequence Problem for Arc-Annotated Sequences. CPM 2000: 154-165 |
115 | ![]() ![]() ![]() ![]() ![]() ![]() | Guo-Hui Lin, Tao Jiang, Paul E. Kearney: Phylogenetic k-Root and Steiner k-Root. ISAAC 2000: 539-551 |
114 | ![]() ![]() ![]() ![]() ![]() ![]() | Vincent Berry, David Bryant, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham, Haoyong Zhang: A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract). SODA 2000: 287-296 |
113 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li, Paul M. B. Vitányi: The Incompressibility Method. SOFSEM 2000: 36-53 |
112 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Dhruv Mubayi: New Upper Bounds for a Canonical Ramsey Problem. Combinatorica 20(1): 141-146 (2000) |
111 | ![]() ![]() ![]() ![]() ![]() ![]() | Hirotsugu Asari, Tao Jiang, André Kündgen, Douglas B. West: Perfection thickness of graphs. Discrete Mathematics 215: 263-264 (2000) |
110 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li, Paul M. B. Vitányi: A lower bound on the average-case complexity of shellsort. J. ACM 47(5): 905-911 (2000) |
109 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Paul E. Kearney, Ming Li: Some Open Problems in Computational Molecular Biology. J. Algorithms 34(1): 194-201 (2000) |
108 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li, Paul M. B. Vitányi: Average-Case Analysis of Algorithms Using Kolmogorov Complexity. J. Comput. Sci. Technol. 15(5): 402-408 (2000) |
107 | ![]() ![]() ![]() ![]() ![]() ![]() | Oren Etzioni, Steve Hanks, Tao Jiang, Omid Madani: Optimal Information Gathering on the Internet with Time and Cost Constraints. SIAM J. Comput. 29(5): 1596-1620 (2000) |
106 | ![]() ![]() ![]() ![]() ![]() ![]() | Lusheng Wang, Tao Jiang, Dan Gusfield: A More Efficient Approximation Scheme for Tree Alignment. SIAM J. Comput. 30(1): 283-299 (2000) |
105 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Paul E. Kearney, Ming Li: A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application. SIAM J. Comput. 30(6): 1942-1961 (2000) |
104 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Dhruv Mubayi, Aditya Shastri, Douglas B. West: Correction to Edge-Bandwidth of Graphs. SIAM J. Discrete Math. 13(1): 1 (2000) |
103 | ![]() ![]() ![]() ![]() ![]() ![]() | Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi: New applications of the incompressibility method: Part II. Theor. Comput. Sci. 235(1): 59-70 (2000) |
1999 | ||
102 | ![]() ![]() ![]() ![]() ![]() ![]() | Vincent Berry, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham: Quartet Cleaning: Improved Algorithms and Simulations. ESA 1999: 313-324 |
101 | ![]() ![]() ![]() ![]() ![]() ![]() | Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi: New Applications of the Incompressibility Method. ICALP 1999: 220-229 |
100 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li, Paul M. B. Vitányi: Average-Case Complexity of Shellsort. ICALP 1999: 453-462 |
99 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li, Paul M. B. Vitányi: The Expected Size of Heilbronn's Triangles. IEEE Conference on Computational Complexity 1999: 105-113 |
98 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ronald D. Blanton: Particulate failures for surface-micromachined MEMS. ITC 1999: 329-337 |
97 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li, Paul M. B. Vitányi: Some Examples of Average-case Analysis by the Imcompressibility Method. Jewels are Forever 1999: 250-261 |
96 | ![]() ![]() ![]() ![]() ![]() ![]() | Paul E. Kearney, Ming Li, John Tsang, Tao Jiang: Recovering Branches on the Tree of Life: An Approximation Algorithm. SODA 1999: 537-546 |
95 | ![]() ![]() ![]() ![]() ![]() ![]() | Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp: On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees. Algorithmica 25(2-3): 176-195 (1999) |
94 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li, Paul M. B. Vitányi: Average-Case Complexity of Shellsort (Preliminary version) CoRR cs.CC/9906008: (1999) |
93 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li, Paul M. B. Vitányi: Average-Case Complexity of Shellsort CoRR cs.DS/9901010: (1999) |
92 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li, Paul M. B. Vitányi: The Average-Case Area of Heilbronn-Type Triangles CoRR math.CO/9902043: (1999) |
91 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li, Paul M. B. Vitányi: New Applications of the Incompressibility Method. Comput. J. 42(4): 287-293 (1999) |
90 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West: Chromatic spectrum is broken. Electronic Notes in Discrete Mathematics 3: 86-89 (1999) |
89 | ![]() ![]() ![]() ![]() ![]() ![]() | Yufang Hua, Tao Jiang, Bin Wu: Aligning DNA Sequences to Minimize the Change in Protein. J. Comb. Optim. 3(2-3): 227-245 (1999) |
88 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Reuben Settergren, Edward C. Thayer: An Algorithmic Approach to Multiple Complete Digest Mapping. Journal of Computational Biology 6(2): 187-208 (1999) |
87 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Dhruv Mubayi, Aditya Shastri, Douglas B. West: Edge-Bandwidth of Graphs. SIAM J. Discrete Math. 12(3): 307-316 (1999) |
86 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Paul E. Kearney, Ming Li: Some open problems in computational molecular biology. SIGACT News 30(3): 43-49 (1999) |
1998 | ||
85 | ![]() ![]() ![]() ![]() ![]() ![]() | Yufang Hua, Tao Jiang, Bin Wu: Aligning DNA Sequences to Minimize the Change in Protein (Extended Abstract). CPM 1998: 221-234 |
84 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Paul E. Kearney, Ming Li: Orchestrating Quartets: Approximation and Data Correction. FOCS 1998: 416-425 |
83 | ![]() ![]() ![]() ![]() ![]() ![]() | Zhongzhi Shi, Yunfeng Li, Wenjie Wang, Hu Cao, Tao Jiang: AOSDE: An Agent-Oriented Software Development Environment. ICMAS 1998: 467-468 |
82 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Nitin Sharma: Constructing maps using the span and inclusion relations. RECOMB 1998: 64-73 |
81 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Richard M. Karp: Mapping Clones with a Given Ordering or Interleaving. Algorithmica 21(3): 262-284 (1998) |
80 | ![]() ![]() ![]() ![]() ![]() ![]() | Harry Buhrman, Tao Jiang, Ming Li, Paul M. B. Vitányi: New Applications of the Incompressibility Method: Part II CoRR cs.CC/9809060: (1998) |
79 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li, Paul M. B. Vitányi: New Applications of the Incompressibility Method: Part I CoRR cs.CC/9809061: (1998) |
78 | ![]() ![]() ![]() ![]() ![]() ![]() | Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Elizabeth Sweedyk: On the Complexity and Approximation of Syntenic Distance. Discrete Applied Mathematics 88(1-3): 59-82 (1998) |
1997 | ||
77 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, D. T. Lee: Computing and Combinatorics, Third Annual International Conference, COCOON '97, Shanghai, China, August 20-22, 1997, Proceedings Springer 1997 |
76 | ![]() ![]() ![]() ![]() ![]() ![]() | Daniel P. Fasulo, Tao Jiang, Richard M. Karp, Reuben Settergren, Edward C. Thayer: An algorithmic approach to multiple complete digest mapping. RECOMB 1997: 118-127 |
75 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Richard M. Karp: Mapping clones with a given ordering or interleaving (abstract). RECOMB 1997: 162 |
74 | ![]() ![]() ![]() ![]() ![]() ![]() | Lusheng Wang, Tao Jiang, Dan Gusfield: A more efficient approximation scheme for tree alignment. RECOMB 1997: 310-319 |
73 | ![]() ![]() ![]() ![]() ![]() ![]() | Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Z. Sweedyk: On the complexity and approximation of syntenic distance. RECOMB 1997: 99-108 |
72 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Richard M. Karp: Mapping Clones with a Given Ordering or Interleaving (Extended Abstract). SODA 1997: 400-409 |
71 | ![]() ![]() ![]() ![]() ![]() ![]() | Bhaskar DasGupta, Xin He, Tao Jiang, Ming Li, John Tromp, Louxin Zhang: On Distances between Phylogenetic Trees (Extended Abstract). SODA 1997: 427-436 |
70 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li, Bala Ravikumar: Formal Models and Computability. The Computer Science and Engineering Handbook 1997: 31-63 |
69 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Yao Li: Multimode-oriented polynomial transformation-based defuzzification strategy and parameter learning procedure. IEEE Transactions on Systems, Man, and Cybernetics, Part B 27(5): 877-883 (1997) |
68 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi: Two heads are better than two tapes. J. ACM 44(2): 237-256 (1997) |
67 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi: Erratum: ``Two heads are better that two tapes''. J. ACM 44(4): 632 (1997) |
66 | ![]() ![]() ![]() ![]() ![]() ![]() | Dany Breslauer, Tao Jiang, Zhigen Jiang: Rotations of Periodic Strings and Short Superstrings. J. Algorithms 24(2): 340-353 (1997) |
1996 | ||
65 | ![]() ![]() ![]() ![]() ![]() ![]() | Oren Etzioni, Steve Hanks, Tao Jiang, Richard M. Karp, Omid Madani, Orli Waarts: Efficient Information Gathering on the Internet (extended abstract). FOCS 1996: 234-243 |
64 | ![]() ![]() ![]() ![]() ![]() ![]() | Lusheng Wang, Tao Jiang, Eugene L. Lawler: Approximation Algorithms for Tree Alignment with a Given Phylogeny. Algorithmica 16(3): 302-315 (1996) |
63 | ![]() ![]() ![]() ![]() ![]() ![]() | Jotun Hein, Tao Jiang, Lusheng Wang, Kaizhong Zhang: On the Complexity of Comparing Evolutionary Trees. Discrete Applied Mathematics 71(1-3): 153-169 (1996) |
62 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas R. Hancock, Tao Jiang, Ming Li, John Tromp: Lower Bounds on Learning Decision Lists and Trees. Inf. Comput. 126(2): 114-122 (1996) |
61 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li: K One-Way Heads Cannot Do String-Matching. J. Comput. Syst. Sci. 53(3): 513-524 (1996) |
60 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li: DNA Sequencing and String Learning. Mathematical Systems Theory 29(4): 387-405 (1996) |
59 | ![]() ![]() ![]() ![]() ![]() ![]() | Lusheng Wang, Tao Jiang: An approximation scheme for some Steiner tree problems in the plane. Networks 28(4): 187-193 (1996) |
1995 | ||
58 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: Matching and Comparing Sequences in Molecular Biology (Abstract). COCOON 1995: 648-649 |
57 | ![]() ![]() ![]() ![]() ![]() ![]() | Jotun Hein, Tao Jiang, Lusheng Wang, Kaizhong Zhang: On the Complexity of Comparing Evolutionary Trees (Extended Abstract). CPM 1995: 177-190 |
56 | ![]() ![]() ![]() ![]() ![]() ![]() | Thomas R. Hancock, Tao Jiang, Ming Li, John Tromp: Lower Bounds on Learning Decision Lists and Trees (Extended Abstract). STACS 1995: 527-538 |
55 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu: Decision Problems for Patterns. J. Comput. Syst. Sci. 50(1): 53-63 (1995) |
54 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang: New Decidability Results Concerning Two-Way Counter Machines. SIAM J. Comput. 24(1): 123-137 (1995) |
53 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences. SIAM J. Comput. 24(5): 1122-1139 (1995) |
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Vadim G. Timkovsky: Shortest Consistent Superstrings Computable in Polynomial Time. Theor. Comput. Sci. 143(1): 113-122 (1995) |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Lusheng Wang, Kaizhong Zhang: Alignment of Trees - An Alternative to Tree Edit. Theor. Comput. Sci. 143(1): 137-148 (1995) |
1994 | ||
50 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Lusheng Wang, Kaizhong Zhang: Alignment of Trees - An Alternative to Tree Edit. CPM 1994: 75-86 |
49 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences. ICALP 1994: 191-202 |
48 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Lusheng Wang: An Approximation Scheme for Some Steiner Tree Problems in the Plane. ISAAC 1994: 414-422 |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang: On Some Open Problems Concerning the Complexity of Cellular Arrays. Results and Trends in Theoretical Computer Science 1994: 183-196 |
46 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Joel I. Seiferas, Paul M. B. Vitányi: Two heads are better than two tapes. STOC 1994: 668-675 |
45 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Eugene L. Lawler, Lusheng Wang: Aligning sequences via an evolutionary tree: complexity and approximation. STOC 1994: 760-769 |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Kaizhong Zhang, Tao Jiang: Some MAX SNP-Hard Results Concerning Unordered Labeled Trees. Inf. Process. Lett. 49(5): 249-254 (1994) |
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Avrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis: Linear Approximation of Shortest Superstrings. J. ACM 41(4): 630-647 (1994) |
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Lusheng Wang, Tao Jiang: On the Complexity of Multiple Sequence Alignment. Journal of Computational Biology 1(4): 337-348 (1994) |
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Oscar H. Ibarra, Hui Wang: Some Results Concerning 2-D On-Line Tessellation Acceptors and 2-D Alternating Finite Automata. Theor. Comput. Sci. 125(2): 243-257 (1994) |
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li: Approximating Shortest Superstrings with Constraints. Theor. Comput. Sci. 134(2): 473-491 (1994) |
1993 | ||
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu: Inclusion is Undecidable for Pattern Languages. ICALP 1993: 301-312 |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang: New Decidability Results Concerning Two-way Counter Machines and Applications. ICALP 1993: 313-324 |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang: On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages. STACS 1993: 354-364 |
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li: k one-way heads cannot do string-matching. STOC 1993: 62-70 |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li: Approximating Shortest Superstrings with Constraints (Extended Abstract). WADS 1993: 385-396 |
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang: On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages. Int. J. Found. Comput. Sci. 4(2): 135-146 (1993) |
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Hui Wang, Tao Jiang: On Efficient Parallel Algorithms for Solving Set Recurrence Equations. J. Algorithms 14(2): 244-257 (1993) |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Bala Ravikumar: Minimal NFA Problems are Hard. SIAM J. Comput. 22(6): 1117-1141 (1993) |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li: On the Complexity of Learning Strings and Sequences. Theor. Comput. Sci. 119(2): 363-371 (1993) |
1992 | ||
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang, Hui Wang: String Editing on a One-Way Linear Array of Finite-State Machines. IEEE Trans. Computers 41(1): 112-118 (1992) |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: The Synchronization of Nonuniform Networks of Finite Automata Inf. Comput. 97(2): 234-261 (1992) |
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li, Ding-Zhu Du: A Note on Shortest Superstrings with Flipping. Inf. Process. Lett. 44(4): 195-199 (1992) |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Oscar H. Ibarra, Hui Wang, Qi Zheng: A hierarchy result for 2-dimensional TM's operating in small space. Inf. Sci. 64(1-2): 49-56 (1992) |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang, Hui Wang: A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars. Theor. Comput. Sci. 99(2): 301-313 (1992) |
1991 | ||
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Ming Li: On the Complexity of Learning Strings and Sequences. COLT 1991: 367-371 |
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Edward McDowell, Bala Ravikumar: The Structure and Complexity of Minimal NFA's over a Unary Alphabet. FSTTCS 1991: 152-171 |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Bala Ravikumar: Minimal NFA Problems Are Hard. ICALP 1991: 629-640 |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang, Hui Wang: Some Results Concerning 2-D On-line Tessellation Acceptors and 2-D Alternating Finite Automata. MFCS 1991: 221-230 |
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Avrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis: Linear Approximation of Shortest Superstrings STOC 1991: 328-336 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang, Jik H. Chang, Bala Ravikumar: Some Classes of Languages in NC¹ Inf. Comput. 90(1): 86-106 (1991) |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Bala Ravikumar: A Note on the Space Complexity of Some Decision Problems for Finite Automata. Inf. Process. Lett. 40(1): 25-31 (1991) |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang, Edward McDowell, Bala Ravikumar: The Structure and Complexity of Minimal NFA's over a Unary Alphabet. Int. J. Found. Comput. Sci. 2(2): 163-182 (1991) |
17 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang: Learning Regular Languages from Counterexamples. J. Comput. Syst. Sci. 43(2): 299-316 (1991) |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang: The Power of Alternating One-Reversal Counters and Stacks. SIAM J. Comput. 20(2): 278-290 (1991) |
1990 | ||
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: On the Complexity of (Off-Line) 1-Tape ATM's Running in Constant Reversals. ICCI 1990: 92-99 |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang, Hui Wang: String Editing on a One-Way Linear Array of Finite-State Machines. ICPP (3) 1990: 173-176 |
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Hui Wang, Tao Jiang: Efficient parallel algorithms for solving set recurrence equations and applications. SPDP 1990: 480-487 |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: On the Complexity of 1-Tape ATMs and Off-line 1-Tape ATMs Running in Constant Reversals. Theor. Comput. Sci. 76(2-3): 323-330 (1990) |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang, Jik H. Chang, Michael A. Palis: Systolic algorithms for some scheduling and graph problems. VLSI Signal Processing 1(4): 307-320 (1990) |
1989 | ||
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Tao Jiang: The Synchronization of Nonuniform Networks of Finite Automata (Extended Abstract) FOCS 1989: 376-381 |
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang, Hui Wang: Parallel Parsing on a One-way Linear Array of Finite-State Machines. FSTTCS 1989: 291-300 |
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang: Optimal Simulation of Tree Arrays by Linear Arrays. Inf. Process. Lett. 30(6): 295-302 (1989) |
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang, Jik H. Chang: On Iterative and Cellular Tree Arrays. J. Comput. Syst. Sci. 38(3): 452-473 (1989) |
1988 | ||
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang, Bala Ravikumar, Jik H. Chang: On Some Languages in NC. AWOC 1988: 64-73 |
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang: Learning Regular Languages From Counterexamples. COLT 1988: 371-385 |
4 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang, Bala Ravikumar: Some Subclasses of Context-Free Languages In NC1. Inf. Process. Lett. 29(3): 111-117 (1988) |
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang: Relating the Power of Cellular Arrays to Their Closure Properties. Theor. Comput. Sci. 57: 225-238 (1988) |
1987 | ||
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang: On the Computing Power of One-Way Cellular Arrays. ICALP 1987: 550-562 |
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Oscar H. Ibarra, Tao Jiang: On One-Way Cellular Arrays. SIAM J. Comput. 16(6): 1135-1154 (1987) |