On the Computing Power of One-Way Cellular Arrays. - Oscar H. Ibarra; Tao Jiang 001 (ICALP, 1987)

On One-Way Cellular Arrays. - Oscar H. Ibarra; Tao Jiang 001 (SIAM J. Comput., 1987)

On Some Languages in NC. - Oscar H. Ibarra; Tao Jiang 001; Bala Ravikumar; Jik H. Chang (AWOC, 1988)

Trading reversals for alternation. - Oscar H. Ibarra; Tao Jiang 001 (SCT, 1988)

Some Subclasses of Context-Free Languages In NC1. - Oscar H. Ibarra; Tao Jiang 001; Bala Ravikumar (Inf. Process. Lett., 1988)

Relating the Power of Cellular Arrays to Their Closure Properties. - Oscar H. Ibarra; Tao Jiang 001 (Theor. Comput. Sci., 1988)

The Synchronization of Nonuniform Networks of Finite Automata (Extended Abstract) - Tao Jiang 001 (FOCS, 1989)

Parallel Parsing on a One-way Linear Array of Finite-State Machines. - Oscar H. Ibarra; Tao Jiang 001; Hui Wang 008 (FSTTCS, 1989)

Optimal Simulation of Tree Arrays by Linear Arrays. - Oscar H. Ibarra; Tao Jiang 001 (Inf. Process. Lett., 1989)

On Iterative and Cellular Tree Arrays. - Oscar H. Ibarra; Tao Jiang 001; Jik H. Chang (J. Comput. Syst. Sci., 1989)

On the Complexity of (Off-Line) 1-Tape ATM's Running in Constant Reversals. - Tao Jiang 001 (ICCI, 1990)

Efficient parallel algorithms for solving set recurrence equations and applications. - Oscar H. Ibarra; Hui Wang 008; Tao Jiang 001 (SPDP, 1990)

On the Complexity of 1-Tape ATMs and Off-line 1-Tape ATMs Running in Constant Reversals. - Tao Jiang 001 (Theor. Comput. Sci., 1990)

Systolic algorithms for some scheduling and graph problems. - Oscar H. Ibarra; Tao Jiang 001; Jik H. Chang; Michael A. Palis (J. VLSI Signal Process., 1990)

The Structure and Complexity of Minimal NFA's over a Unary Alphabet. - Tao Jiang 001; Edward McDowell; Bala Ravikumar (Int. J. Found. Comput. Sci., 1991)

A Note on the Space Complexity of Some Decision Problems for Finite Automata. - Tao Jiang 001; Bala Ravikumar (Inf. Process. Lett., 1991)

Learning Regular Languages from Counterexamples. - Oscar H. Ibarra; Tao Jiang 001 (J. Comput. Syst. Sci., 1991)

The Power of Alternating One-Reversal Counters and Stacks. - Oscar H. Ibarra; Tao Jiang 001 (SIAM J. Comput., 1991)

Some Classes of Languages in NC¹ - Oscar H. Ibarra; Tao Jiang 001; Jik H. Chang; Bala Ravikumar (Inf. Comput., 1991)

A Note on Shortest Superstrings with Flipping. - Tao Jiang 001; Ming Li 001; Ding-Zhu Du (Inf. Process. Lett., 1992)

A hierarchy result for 2-dimensional TM's operating in small space. - Tao Jiang 001; Oscar H. Ibarra; Hui Wang 008; Qi Zheng 001 (Inf. Sci., 1992)

String Editing on a One-Way Linear Array of Finite-State Machines. - Oscar H. Ibarra; Tao Jiang 001; Hui Wang 008 (IEEE Trans. Computers, 1992)

A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars. - Oscar H. Ibarra; Tao Jiang 001; Hui Wang 008 (Theor. Comput. Sci., 1992)

The Synchronization of Nonuniform Networks of Finite Automata - Tao Jiang 001 (Inf. Comput., 1992)

New Decidability Results Concerning Two-way Counter Machines and Applications. - Oscar H. Ibarra; Tao Jiang 001; Nicholas Q. Trân; Hui Wang 008 (ICALP, 1993)

Inclusion is Undecidable for Pattern Languages. - Tao Jiang 001; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (ICALP, 1993)

Approximating Shortest Superstrings with Constraints (Extended Abstract). - Tao Jiang 001; Ming Li 001 (WADS, 1993)

On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages. - Oscar H. Ibarra; Tao Jiang 001; Nicholas Q. Trân; Hui Wang 008 (Int. J. Found. Comput. Sci., 1993)

On Efficient Parallel Algorithms for Solving Set Recurrence Equations. - Oscar H. Ibarra; Hui Wang 008; Tao Jiang 001 (J. Algorithms, 1993)

Minimal NFA Problems are Hard. - Tao Jiang 001; Bala Ravikumar (SIAM J. Comput., 1993)

On the Complexity of Learning Strings and Sequences. - Tao Jiang 001; Ming Li 001 (Theor. Comput. Sci., 1993)

On Some Open Problems Concerning the Complexity of Cellular Arrays. - Oscar H. Ibarra; Tao Jiang 001 (Results and Trends in Theoretical Computer Science, 1994)

Aligning sequences via an evolutionary tree: complexity and approximation. - Tao Jiang 001; Eugene L. Lawler; Lusheng Wang 001 (STOC, 1994)

Some MAX SNP-Hard Results Concerning Unordered Labeled Trees. - Kaizhong Zhang; Tao Jiang 001 (Inf. Process. Lett., 1994)

Linear Approximation of Shortest Superstrings. - Avrim Blum; Tao Jiang 001; Ming Li 001; John Tromp; Mihalis Yannakakis (J. ACM, 1994)

On the Complexity of Multiple Sequence Alignment. - Lusheng Wang 001; Tao Jiang 001 (J. Comput. Biol., 1994)

Some Results Concerning 2-D On-Line Tessellation Acceptors and 2-D Alternating Finite Automata. - Tao Jiang 001; Oscar H. Ibarra; Hui Wang 008 (Theor. Comput. Sci., 1994)

Approximating Shortest Superstrings with Constraints. - Tao Jiang 001; Ming Li 001 (Theor. Comput. Sci., 1994)

Matching and Comparing Sequences in Molecular Biology (Abstract). - Tao Jiang 001 (COCOON, 1995)

On the Complexity of Comparing Evolutionary Trees (Extended Abstract). - Jotun Hein; Tao Jiang 001; Lusheng Wang 001; Kaizhong Zhang (CPM, 1995)

Lower Bounds on Learning Decision Lists and Trees (Extended Abstract). - Thomas R. Hancock; Tao Jiang 001; Ming Li 001; John Tromp (STACS, 1995)

Decision Problems for Patterns. - Tao Jiang 001; Arto Salomaa; Kai Salomaa; Sheng Yu 001 (J. Comput. Syst. Sci., 1995)

New Decidability Results Concerning Two-Way Counter Machines. - Oscar H. Ibarra; Tao Jiang 001; Nicholas Q. Trân; Hui Wang 008 (SIAM J. Comput., 1995)

On the Approximation of Shortest Common Supersequences and Longest Common Subsequences. - Tao Jiang 001; Ming Li 001 (SIAM J. Comput., 1995)

Shortest Consistent Superstrings Computable in Polynomial Time. - Tao Jiang 001; Vadim G. Timkovsky (Theor. Comput. Sci., 1995)

Alignment of Trees - An Alternative to Tree Edit. - Tao Jiang 001; Lusheng Wang 001; Kaizhong Zhang (Theor. Comput. Sci., 1995)

Efficient Information Gathering on the Internet (extended abstract). - Oren Etzioni; Steve Hanks; Tao Jiang 001; Richard M. Karp; Omid Madani; Orli Waarts (FOCS, 1996)

Approximation Algorithms for Tree Alignment with a Given Phylogeny. - Lusheng Wang 001; Tao Jiang 001; Eugene L. Lawler (Algorithmica, 1996)

On the Complexity of Comparing Evolutionary Trees. - Jotun Hein; Tao Jiang 001; Lusheng Wang 001; Kaizhong Zhang (Discret. Appl. Math., 1996)

Lower Bounds on Learning Decision Lists and Trees. - Thomas R. Hancock; Tao Jiang 001; Ming Li 001; John Tromp (Inf. Comput., 1996)

K One-Way Heads Cannot Do String-Matching. - Tao Jiang 001; Ming Li 001 (J. Comput. Syst. Sci., 1996)

DNA Sequencing and String Learning. - Tao Jiang 001; Ming Li 001 (Math. Syst. Theory, 1996)

An approximation scheme for some Steiner tree problems in the plane. - Lusheng Wang 001; Tao Jiang 001 (Networks, 1996)

Formal Models and Computability. - Tao Jiang 001; Ming Li 001; Bala Ravikumar (The Computer Science and Engineering Handbook, 1997)

Shortest common superstrings. - Ming Li 001; Tao Jiang 001 (Pattern Matching Algorithms, 1997)

Mapping clones with a given ordering or interleaving (abstract). - Tao Jiang 001; Richard M. Karp (RECOMB, 1997)

On Distances between Phylogenetic Trees (Extended Abstract). - Bhaskar DasGupta; Xin He 005; Tao Jiang 001; Ming Li 001; John Tromp; Louxin Zhang (SODA, 1997)

Mapping Clones with a Given Ordering or Interleaving (Extended Abstract). - Tao Jiang 001; Richard M. Karp (SODA, 1997)

Two heads are better than two tapes. - Tao Jiang 001; Joel I. Seiferas; Paul M. B. Vitányi (J. ACM, 1997)

Erratum: "Two heads are better that two tapes". - Tao Jiang 001; Joel I. Seiferas; Paul M. B. Vitányi (J. ACM, 1997)

Rotations of Periodic Strings and Short Superstrings. - Dany Breslauer; Tao Jiang 001; Zhigen Jiang (J. Algorithms, 1997)

Aligning DNA Sequences to Minimize the Change in Protein (Extended Abstract). - Yufang Hua; Tao Jiang 001; Bin Wu (CPM, 1998)

Orchestrating Quartets: Approximation and Data Correction. - Tao Jiang 001; Paul E. Kearney; Ming Li 001 (FOCS, 1998)

Constructing maps using the span and inclusion relations. - Daniel P. Fasulo; Tao Jiang 001; Richard M. Karp; Nitin Sharma 002 (RECOMB, 1998)

Mapping Clones with a Given Ordering or Interleaving. - Tao Jiang 001; Richard M. Karp (Algorithmica, 1998)

New Applications of the Incompressibility Method: Part I - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (CoRR, 1998)

On the Complexity and Approximation of Syntenic Distance. - Bhaskar DasGupta; Tao Jiang 001; Sampath Kannan; Ming Li 001; Elizabeth Sweedyk (Discret. Appl. Math., 1998)

Basic Notions in Computational Complexity. - Tao Jiang 001; Ming Li 001; Bala Ravikumar (Algorithms and Theory of Computation Handbook, 1999)

Computability. - Tao Jiang 001; Ming Li 001; Bala Ravikumar; Kenneth W. Regan (Algorithms and Theory of Computation Handbook, 1999)

Formal Grammars and Languages. - Tao Jiang 001; Ming Li 001; Bala Ravikumar; Kenneth W. Regan (Algorithms and Theory of Computation Handbook, 1999)

Some Examples of Average-case Analysis by the Imcompressibility Method. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (Jewels are Forever, 1999)

The Expected Size of Heilbronn's Triangles. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (CCC, 1999)

On computing the nearest neighbor interchange distance. - Bhaskar DasGupta; Xin He 005; Tao Jiang 001; Ming Li 001; John Tromp; Louxin Zhang (Discrete Mathematical Problems with Medical Applications, 1999)

Quartet Cleaning: Improved Algorithms and Simulations. - Vincent Berry; Tao Jiang 001; Paul E. Kearney; Ming Li 001; Todd Wareham (ESA, 1999)

New Applications of the Incompressibility Method. - Harry Buhrman; Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (ICALP, 1999)

Average-Case Complexity of Shellsort. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (ICALP, 1999)

Recovering Branches on the Tree of Life: An Approximation Algorithm. - Paul E. Kearney; Ming Li 001; John Tsang; Tao Jiang 001 (SODA, 1999)

On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees. - Bhaskar DasGupta; Xin He 005; Tao Jiang 001; Ming Li 001; John Tromp (Algorithmica, 1999)

New Applications of the Incompressibility Method. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (Comput. J., 1999)

Average-Case Complexity of Shellsort (Preliminary version) - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (CoRR, 1999)

An Algorithmic Approach to Multiple Complete Digest Mapping. - Daniel P. Fasulo; Tao Jiang 001; Richard M. Karp; Reuben J. Settergren; Edward C. Thayer (J. Comput. Biol., 1999)

Aligning DNA Sequences to Minimize the Change in Protein. - Yufang Hua; Tao Jiang 001; Bin Wu (J. Comb. Optim., 1999)

Some open problems in computational molecular biology. - Tao Jiang 001; Paul E. Kearney; Ming Li 001 (SIGACT News, 1999)

Better Bounds on the Accommodating Ratio for the Seat Reservation Problem. - Eric Bach 001; Joan Boyar; Tao Jiang 001; Kim S. Larsen; Guo-Hui Lin (COCOON, 2000)

Phylogenetic k-Root and Steiner k-Root. - Guo-Hui Lin; Tao Jiang 001; Paul E. Kearney (ISAAC, 2000)

A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract). - Vincent Berry; David Bryant; Tao Jiang 001; Paul E. Kearney; Ming Li 001; Todd Wareham; Haoyong Zhang (SODA, 2000)

The Incompressibility Method. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (SOFSEM, 2000)

A lower bound on the average-case complexity of shellsort. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (J. ACM, 2000)

Average-Case Analysis of Algorithms Using Kolmogorov Complexity. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (J. Comput. Sci. Technol., 2000)

Optimal Information Gathering on the Internet with Time and Cost Constraints. - Oren Etzioni; Steve Hanks; Tao Jiang 001; Omid Madani (SIAM J. Comput., 2000)

A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application. - Tao Jiang 001; Paul E. Kearney; Ming Li 001 (SIAM J. Comput., 2000)

A More Efficient Approximation Scheme for Tree Alignment. - Lusheng Wang 001; Tao Jiang 001; Dan Gusfield (SIAM J. Comput., 2000)

New applications of the incompressibility method: Part II. - Harry Buhrman; Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (Theor. Comput. Sci., 2000)

An efficient algorithm for finding short approximate non-tandem repeats. - Ezekiel F. Adebiyi; Tao Jiang 001; Michael Kaufmann 001 (ISMB (Supplement of Bioinformatics), 2001)

Probe selection algorithms with applications in the analysis of microbial communities. - James Borneman; Marek Chrobak; Gianluca Della Vedova; Andres Figueroa; Tao Jiang 001 (ISMB (Supplement of Bioinformatics), 2001)

A Heuristic Algorithm for Multiple Sequence Alignment Based on Blocks. - Peng Zhao; Tao Jiang 001 (J. Comb. Optim., 2001)

An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks. - Guo-Hui Lin; Dong Xu 002; Zhi-Zhong Chen; Tao Jiang 001; Jianjun Wen; Ying Xu 001 (CSB, 2002)

Identifying transcription factor binding sites through Markov chain optimization. - Kyle Ellrott; Chuhu Yang; Frances M. Sladek; Tao Jiang 001 (ECCB, 2002)

Approximating minimum quartet inconsistency (abstract). - Gianluca Della Vedova; Tao Jiang 001; Jing Li 002; Jianjun Wen (SODA, 2002)

Improved Approximation Algorithms for NMR Spectral Peak Assignment. - Zhi-Zhong Chen; Tao Jiang 001; Guo-Hui Lin; Jianjun Wen; Dong Xu 002; Ying Xu 001 (WABI, 2002)

Automated assignment of backbone NMR peaks using constrained bipartite matching. - Ying Xu 001; Dong Xu 002; Dongsup Kim; Victor Olman; Jane Razumovskaya; Tao Jiang 001 (Comput. Sci. Eng., 2002)

A General Edit Distance between RNA Structures. - Tao Jiang 001; Guohui Lin; Bin Ma 002; Kaizhong Zhang (J. Comput. Biol., 2002)

The longest common subsequence problem for sequences with nested arc annotations. - Guo-Hui Lin; Zhi-Zhong Chen; Tao Jiang 001; Jianjun Wen (J. Comput. Syst. Sci., 2002)

Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. - Yaw-Ling Lin; Tao Jiang 001; Kun-Mao Chao (J. Comput. Syst. Sci., 2002)

The average-case area of Heilbronn-type triangles. - Tao Jiang 001; Ming Li 001; Paul M. B. Vitányi (Random Struct. Algorithms, 2002)

Computational Inference of Regulatory Pathways in Microbes. - Zhengchang Su; PhuongAn Dam; Xin Chen 037; Victor Olman; Tao Jiang 001; Brian Palenik; Ying Xu 001 (CSB, 2003)

Statistical Validation of Compound Structure-Selectivity Relationship Using NCI Cancer Database. - Jing Li 002; Chris Benner; Tao Jiang 001; Yingyao Zhou (METMBS, 2003)

Efficient rule-based haplotyping algorithms for pedigree data. - Jing Li 002; Tao Jiang 001 (RECOMB, 2003)

Minimum Recombiant Haplotype Configuration on Tree Pedigrees. - Koichiro Doi; Jing Li 002; Tao Jiang 001 (WABI, 2003)

MAVG: locating non-overlapping maximum average segments in a given sequence. - Yaw-Ling Lin; Xiaoqiu Huang 001; Tao Jiang 001; Kun-Mao Chao (Bioinform., 2003)

Efficient Inference of Haplotypes from Genotypes on a Pedigree. - Jing Li 002; Tao Jiang 001 (J. Bioinform. Comput. Biol., 2003)

Computational Assignment of Protein Backbone Nmr Peaks Byefficient Bounding and Filtering. - Guohui Lin; Dong Xu 002; Zhi-Zhong Chen; Tao Jiang 001; Jianjun Wen; Ying Xu 001 (J. Bioinform. Comput. Biol., 2003)

Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem. - Eric Bach 001; Joan Boyar; Leah Epstein; Lene M. Favrholdt; Tao Jiang 001; Kim S. Larsen; Guo-Hui Lin; Rob van Stee (J. Sched., 2003)

Computing Phylogenetic Roots with Bounded Degrees and Errors. - Zhi-Zhong Chen; Tao Jiang 001; Guohui Lin (SIAM J. Comput., 2003)

Approximation algorithms for NMR spectral peak assignment. - Zhi-Zhong Chen; Tao Jiang 001; Guo-Hui Lin; Jianjun Wen; Dong Xu 002; Jinbo Xu; Ying Xu 001 (Theor. Comput. Sci., 2003)

Minimum Entropy Clustering and Applications to Gene Expression Analysis. - Haifeng Li 012; Keshu Zhang; Tao Jiang 001 (CSB, 2004)

Computational Construction of Nitrogen Assimilation Pathway in Cyanobacteria Synechococcus sp. WH8102. - Zhengchang Su; PhuongAn Dam; X. Chen; Victor Olman; Tao Jiang 001; Ying Xu 001 (CSB, 2004)

An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming. - Jing Li 002; Tao Jiang 001 (RECOMB, 2004)

Efficient selection of unique and popular oligos for large EST databases. - Jie Zheng 002; Timothy J. Close; Tao Jiang 001; Stefano Lonardi (Bioinform., 2004)

Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme. - Jonathan H. Badger; Paul E. Kearney; Ming Li 001; John Tsang; Tao Jiang 001 (J. Algorithms, 2004)

Clustering Binary Fingerprint Vectors with Missing Values for DNA Array Data Analysis. - Andres Figueroa; James Borneman; Tao Jiang 001 (J. Comput. Biol., 2004)

A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition. - Guohui Lin; Tao Jiang 001 (J. Comb. Optim., 2004)

Foreword - Special Issue on Bioinformatics. - Paola Bonizzoni; Gianluca Della Vedova; Tao Jiang 001 (J. Comput. Sci. Technol., 2004)

The longest common subsequence problem for arc-annotated sequences. - Tao Jiang 001; Guohui Lin; Bin Ma 002; Kaizhong Zhang (J. Discrete Algorithms, 2004)

The Regularized EM Algorithm. - Haifeng Li 012; Keshu Zhang; Tao Jiang 001 (AAAI, 2005)

Computing the Assignment of Orthologous Genes via Genome Rearrangement. - Xin Chen 037; Jie Zheng 002; Zheng Fu; Peng Nan; Yang Zhong; Stefano Lonardi; Tao Jiang 001 (APBC, 2005)

Approximate Clustering of Fingerprint Vectors with Missing Values. - Andres Figueroa; Avraham Goldstein; Tao Jiang 001; Maciej Kurowski; Andrzej Lingas; Mia Persson (CATS, 2005)

A Fast Algorithm for Approximate String Matching on Gene Sequences. - Zheng Liu; Xin Chen 037; James Borneman; Tao Jiang 001 (CPM, 2005)

Robust and Accurate Cancer Classification with Gene Expression Profiling. - Haifeng Li 012; Keshu Zhang; Tao Jiang 001 (CSB, 2005)

Companding technique for PAPR reduction in OFDM systems based on an exponential function. - Tao Jiang 001; Yang Yang 001; Yong-Hua Song (GLOBECOM, 2005)

Correlation Clustering and Consensus Clustering. - Paola Bonizzoni; Gianluca Della Vedova; Riccardo Dondi; Tao Jiang 001 (ISAAC, 2005)

Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem. - Lan Liu 001; Xi Chen 001; Jing Xiao; Tao Jiang 001 (ISAAC, 2005)

Haplotype-based linkage disequilibrium mapping via direct data mining. - Jing Li 002; Tao Jiang 001 (Bioinform., 2005)

A software system for gene sequence database construction based on fast approximate string matching. - Zheng Liu; James Borneman; Tao Jiang 001 (Int. J. Bioinform. Res. Appl., 2005)

More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling. - Zhi-Zhong Chen; Guohui Lin; Romeo Rizzi; Jianjun Wen; Dong Xu 002; Ying Xu 001; Tao Jiang 001 (J. Comput. Biol., 2005)

A Class of Edit Kernels for SVMs to Predict Translation Initiation Sites in Eukaryotic mRNAs. - Haifeng Li 012; Tao Jiang 001 (J. Comput. Biol., 2005)

Computing the Minimum Recombinant Haplotype Configuration from Incomplete Genotype Data on a Pedigree by Integer Linear Programming. - Jing Li 002; Tao Jiang 001 (J. Comput. Biol., 2005)

Exponential companding technique for PAPR reduction in OFDM systems. - Tao Jiang 001; Yang Yang 001; Yong-Hua Song (IEEE Trans. Broadcast., 2005)

Assignment of Orthologous Genes via Genome Rearrangement. - Xin Chen 037; Jie Zheng 002; Zheng Fu; Peng Nan; Yang Zhong; Stefano Lonardi; Tao Jiang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2005)

Understanding microbial genomic structures and applications to biological pathway inference. - Zhengchang Su; Fenglou Mao; Hongwei Wu; PhuongAn Dam; Xin Chen 037; Tao Jiang 001; Victor Olman; Brian Palenik; Ying Xu 001 (GrC, 2006)

A Parsimony Approach to Genome-Wide Ortholog Assignment. - Zheng Fu; Xin Chen 037; Vladimir Vacic; Peng Nan; Yang Zhong; Tao Jiang 001 (RECOMB, 2006)

OligoSpawn: a software tool for the design of overgo probes from large unigene datasets. - Jie Zheng 002; Jan T. Svensson; Kavitha Madishetty; Timothy J. Close; Tao Jiang 001; Stefano Lonardi (BMC Bioinform., 2006)

A General Framework for Biclustering Gene Expression Data. - Haifeng Li 012; Xin Chen 037; Keshu Zhang; Tao Jiang 001 (J. Bioinform. Comput. Biol., 2006)

A network flow approach to the Minimum Common Integer Partition Problem. - Wenbo Zhao 001; Peng Zhang 008; Tao Jiang 001 (Theor. Comput. Sci., 2006)

Efficient and robust feature extraction by maximum margin criterion. - Haifeng Li 012; Tao Jiang 001; Keshu Zhang (IEEE Trans. Neural Networks, 2006)

A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search. - Tao Jiang 001 (CPM, 2007)

Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree. - Jing Xiao; Lan Liu 001; Lirong Xia; Tao Jiang 001 (SODA, 2007)

Study of gene function based on spatial co-expression in a high-resolution mouse brain atlas. - Zheng Liu; S. Frank Yan; John R. Walker; Theresa A. Zwingman; Tao Jiang 001; Jing Li 002; Yingyao Zhou (BMC Syst. Biol., 2007)

Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility. - Brendan Lucier; Tao Jiang 001; Ming Li 001 (Inf. Process. Lett., 2007)

Computing the Breakpoint Distance between Partially Ordered genomes. - Zheng Fu; Tao Jiang 001 (J. Bioinform. Comput. Biol., 2007)

MSOAR: A High-Throughput Ortholog Assignment System Based on Genome Rearrangement. - Zheng Fu; Xin Chen 037; Vladimir Vacic; Peng Nan; Yang Zhong; Tao Jiang 001 (J. Comput. Biol., 2007)

Complexity and approximation of the minimum recombinant haplotype configuration problem. - Lan Liu 001; Xi Chen 001; Jing Xiao; Tao Jiang 001 (Theor. Comput. Sci., 2007)

Finding Additive Biclusters with Random Background. - Jing Xiao; Lusheng Wang 001; Xiaowen Liu; Tao Jiang 001 (CPM, 2008)

A maximum common substructure-based algorithm for searching and predicting drug-like compounds. - Yiqun Cao; Tao Jiang 001; Thomas Girke (ISMB, 2008)

ChemmineR: a compound mining framework for R. - Yiqun Cao; Anna Charisi; Li-Chang Cheng; Tao Jiang 001; Thomas Girke (Bioinform., 2008)

W-AlignACE: an improved Gibbs sampling algorithm based on more accurate position weight matrices learned from sequence and gene expression/ChIP-chip data. - Xin Chen 037; Lingqiong Guo; Zhaocheng Fan; Tao Jiang 001 (Bioinform., 2008)

Clustering of Main orthologs for Multiple genomes. - Zheng Fu; Tao Jiang 001 (J. Bioinform. Comput. Biol., 2008)

A Survey on Haplotyping Algorithms for Tightly Linked Markers. - Jing Li 002; Tao Jiang 001 (J. Bioinform. Comput. Biol., 2008)

An Efficient Voting Algorithm for Finding Additive Biclusters with Random Background. - Jing Xiao; Lusheng Wang 001; Xiaowen Liu; Tao Jiang 001 (J. Comput. Biol., 2008)

On the Approximation of Correlation Clustering and Consensus Clustering. - Paola Bonizzoni; Gianluca Della Vedova; Riccardo Dondi; Tao Jiang 001 (J. Comput. Syst. Sci., 2008)

Approximate clustering of incomplete fingerprints. - Andres Figueroa; Avraham Goldstein; Tao Jiang 001; Maciej Kurowski; Andrzej Lingas; Mia Persson (J. Discrete Algorithms, 2008)

On the minimum common integer partition problem. - Xin Chen 037; Lan Liu 001; Zheng Liu; Tao Jiang 001 (ACM Trans. Algorithms, 2008)

Nearest Neighbor Interchange and Related Distances. - Bhaskar DasGupta; Xin He 005; Tao Jiang 001; Ming Li 001; John Tromp; Louxin Zhang (Encyclopedia of Algorithms, 2008)

Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract). - Wei-Bung Wang; Tao Jiang 001 (CPM, 2009)

An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract). - Jing Xiao; Tiancheng Lou; Tao Jiang 001 (ESA, 2009)

Computational prediction of novel non-coding RNAs in Arabidopsis thaliana. - Dandan Song; Yang Yang 030; Bin Yu; Binglian Zheng; Zhidong Deng; Bao-Liang Lu; Xuemei Chen; Tao Jiang 001 (BMC Bioinform., 2009)

Some Algorithmic Challenges in Genome-Wide Ortholog Assignment. - Tao Jiang 001 (J. Comput. Sci. Technol., 2009)

Preface. - Ying Xu 001; Ming Li 001; Tao Jiang 001 (J. Comput. Sci. Technol., 2009)

Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigree Based on Fast Elimination of Redundant Linear Equations. - Jing Xiao; Lan Liu 001; Lirong Xia; Tao Jiang 001 (SIAM J. Comput., 2009)

Polony Identification Using the EM Algorithm Based on a Gaussian Mixture Model. - Wei Li 035; Paul M. Ruegger; James Borneman; Tao Jiang 001 (BIBE, 2010)

Haplotype Inference on Pedigrees with Recombinations and Mutations. - Yuri Pirola; Paola Bonizzoni; Tao Jiang 001 (WABI, 2010)

Accelerated similarity searching and clustering of large compound sets by geometric embedding and locality sensitive hashing. - Yiqun Cao; Tao Jiang 001; Thomas Girke (Bioinform., 2010)

MSOAR 2.0: Incorporating tandem duplications into ortholog assignment based on genome rearrangement. - Guanqun Shi; Liqing Zhang 002; Tao Jiang 001 (BMC Bioinform., 2010)

Accurate HLA type inference using a weighted similarity graph. - Minzhu Xie; Jing Li 002; Tao Jiang 001 (BMC Bioinform., 2010)

Computational prediction of type III secreted proteins from gram-negative bacteria. - Yang Yang 030; Jiayuan Zhao; Robyn L. Morgan; Wenbo Ma; Tao Jiang 001 (BMC Bioinform., 2010)

Efficient Genome-Wide TagSNP Selection Across Populations via the Linkage Disequilibrium Criterion. - Lan Liu 001; Yonghui Wu; Stefano Lonardi; Tao Jiang 001 (J. Comput. Biol., 2010)

A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops. - Lan Liu 001; Tao Jiang 001 (J. Comb. Optim., 2010)

Beyond evolutionary trees. - Gianluca Della Vedova; Riccardo Dondi; Tao Jiang 001; Giulio Pavesi; Yuri Pirola; Lusheng Wang 001 (Nat. Comput., 2010)

Workshop: Transcriptome assembly from RNA-Seq data: Objectives, algorithms and challenges. - Wei Li 035; Jianxing Feng; Tao Jiang 001 (ICCABS, 2011)

IsoLasso: A LASSO Regression Approach to RNA-Seq Based Transcriptome Assembly - (Extended Abstract). - Wei Li 035; Jianxing Feng; Tao Jiang 001 (RECOMB, 2011)

Separating Metagenomic Short Reads into Genomes via Clustering - (Extended Abstract). - Olga Tanaseichuk; James Borneman; Tao Jiang 001 (WABI, 2011)

SEED: efficient clustering of next-generation sequences. - Ergude Bao; Tao Jiang 001; Isgouhi Kaloshian; Thomas Girke (Bioinform., 2011)

Uncover disease genes by maximizing information flow in the phenome-interactome network. - Yong Chen; Tao Jiang 001; Rui Jiang 001 (Bioinform., 2011)

Improving Probe Set Selection for Microbial Community Analysis by Leveraging Taxonomic Information of Training Sequences. - Paul M. Ruegger; Gianluca Della Vedova; Tao Jiang 001; James Borneman (BMC Bioinform., 2011)

Inferring Haplotypes from genotypes on a Pedigree with mutations, genotyping Errors and Missing Alleles. - Wei-Bung Wang; Tao Jiang 001 (J. Bioinform. Comput. Biol., 2011)

IsoLasso: A LASSO Regression Approach to RNA-Seq Based Transcriptome Assembly. - Wei Li 035; Jianxing Feng; Tao Jiang 001 (J. Comput. Biol., 2011)

Inference of Isoforms from Short Sequence Reads. - Jianxing Feng; Wei Li 035; Tao Jiang 001 (J. Comput. Biol., 2011)

A Max-Flow-Based Approach to the Identification of Protein Complexes Using Protein Interaction and Microarray Data. - Jianxing Feng; Rui Jiang 001; Tao Jiang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

Workshop: Transcriptome assembly and isoform expression level estimation from biased RNA-Seq reads. - Wei Li 035; Tao Jiang 001 (ICCABS, 2012)

A Probabilistic Approach to Accurate Abundance-Based Binning of Metagenomic Reads. - Olga Tanaseichuk; James Borneman; Tao Jiang 001 (WABI, 2012)

An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants. - Jing Xiao; Tiancheng Lou; Tao Jiang 001 (Algorithmica, 2012)

Separating metagenomic short reads into genomes via clustering. - Olga Tanaseichuk; James Borneman; Tao Jiang 001 (Algorithms Mol. Biol., 2012)

Transcriptome assembly and isoform expression level estimation from biased RNA-Seq reads. - Wei Li 035; Tao Jiang 001 (Bioinform., 2012)

Detecting genome-wide epistases based on the clustering of relatively frequent items. - Minzhu Xie; Jing Li 002; Tao Jiang 001 (Bioinform., 2012)

A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on a pedigree. - En-Yu Lai; Wei-Bung Wang; Tao Jiang 001; Kun-Pin Wu (BMC Bioinform., 2012)

A fast and accurate algorithm for single individual haplotyping. - Minzhu Xie; Jianxin Wang 001; Tao Jiang 001 (BMC Syst. Biol., 2012)

An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations. - Yuri Pirola; Paola Bonizzoni; Tao Jiang 001 (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

BRANCH: boosting RNA-Seq assemblies with partial or related genomic sequences. - Ergude Bao; Tao Jiang 001; Thomas Girke (Bioinform., 2013)

Differential gene expression analysis using coexpression and RNA-Seq data. - Ei-Wen Yang; Thomas Girke; Tao Jiang 001 (Bioinform., 2013)

Formal Models and Computability. - Tao Jiang 001; Ming Li 001; Bala Ravikumar (Computing Handbook, 3rd ed. (1), 2014)

Zero-determinant strategy in cheating management of wireless cooperation. - Huaqing Zhang 001; Dusit Niyato; Lingyang Song; Tao Jiang 001; Zhu Han 001 (GLOBECOM, 2014)

GDNorm: An Improved Poisson Regression Model for Reducing Biases in Hi-C Data. - Ei-Wen Yang; Tao Jiang 001 (WABI, 2014)

AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references. - Ergude Bao; Tao Jiang 001; Thomas Girke (Bioinform., 2014)

Phylogeny-based classification of microbial communities. - Olga Tanaseichuk; James Borneman; Tao Jiang 001 (Bioinform., 2014)

Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. - Peng Zhang 008; Tao Jiang 001; Angsheng Li (COCOON, 2015)

Equilibrium analysis for zero-determinant strategy in resource management of wireless network. - Huaqing Zhang 001; Dusit Niyato; Lingyang Song; Tao Jiang 001; Zhu Han 001 (WCNC, 2015)

Differential regulation enrichment analysis via the integration of transcriptional regulatory network and gene expression data. - Shining Ma; Tao Jiang 001; Rui Jiang 001 (Bioinform., 2015)

Accurate inference of isoforms from multiple sample RNA-Seq data. - Masruba Tasnim; Shining Ma; Ei-Wen Yang; Tao Jiang 001; Wei Li 035 (BMC Genom., 2015)

Uniformly asymptotic behavior of ruin probabilities in a time-dependent renewal risk model with stochastic return. - Yang Yang 021; Zhimin Zhang 009; Tao Jiang 001; Dongya Cheng (J. Comput. Appl. Math., 2015)

H-PoP and H-PoPG: heuristic partitioning algorithms for single individual haplotyping of polyploids. - Minzhu Xie; Qiong Wu; Jianxin Wang 001; Tao Jiang 001 (Bioinform., 2016)

SDEAP: a splice graph based differential transcript expression analysis tool for population data. - Ei-Wen Yang; Tao Jiang 001 (Bioinform., 2016)

ROSE: A Deep Learning Based Framework for Predicting Ribosome Stalling. - Sai Zhang; Hailin Hu 002; Jingtian Zhou; Xuan He; Tao Jiang 001; Jianyang Zeng 001 (RECOMB, 2017)

TITER: predicting translation initiation sites by deep learning. - Sai Zhang; Hailin Hu 002; Tao Jiang 001; Lei Zhang 095; Jianyang Zeng 001 (Bioinform., 2017)

Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. - Peng Zhang 008; Yao Xu; Tao Jiang 001; Angsheng Li; Guohui Lin; Eiji Miyano (Algorithmica, 2018)

TAPAS: tool for alternative polyadenylation site analysis. - Ashraful Arefeen; Juntao Liu; Xinshu Xiao; Tao Jiang 001 (Bioinform., 2018)

DeepPASTA: deep neural network based polyadenylation site analysis. - Ashraful Arefeen; Xinshu Xiao; Tao Jiang 001 (Bioinform., 2019)

DIFFUSE: predicting isoform functions from sequences and expression profiles via deep learning. - Hao Chen 097; Dipan Shaw; Jianyang Zeng 001; Dongbo Bu; Tao Jiang 001 (Bioinform., 2019)

DeepHINT: understanding HIV-1 integration via deep learning with attention. - Hailin Hu 002; An Xiao; Sai Zhang; Yangyang Li; Xuanling Shi; Tao Jiang 001; Linqi Zhang; Lei Zhang 095; Jianyang Zeng 001 (Bioinform., 2019)

DeepIsoFun: a deep domain adaptation approach to predict isoform functions. - Dipan Shaw; Hao Chen 097; Tao Jiang 001 (Bioinform., 2019)

NeoDTI: neural integration of neighbor information from a heterogeneous network for discovering new drug-target interactions. - Fangping Wan; Lixiang Hong; An Xiao; Tao Jiang 001; Jianyang Zeng 001 (Bioinform., 2019)

End-to-End Unpaired Image Denoising with Conditional Adversarial Networks. - Zhiwei Hong; Xiaocheng Fan; Tao Jiang 001; Jianxing Feng (AAAI, 2020)

Reinforced Molecular Optimization with Neighborhood-Controlled Grammars. - Chencheng Xu; Qiao Liu 008; Minlie Huang; Tao Jiang 001 (NeurIPS, 2020)

MONN: A Multi-objective Neural Network for Predicting Pairwise Non-covalent Interactions and Binding Affinities Between Compounds and Proteins. - Shuya Li; Fangping Wan; Hantao Shu; Tao Jiang 001; Dan Zhao 004; Jianyang Zeng 001 (RECOMB, 2020)

Quantifying functional impact of non-coding variants with multi-task Bayesian neural network. - Chencheng Xu; Qiao Liu 008; Jianyu Zhou; Minzhu Xie; Jianxing Feng; Tao Jiang 001 (Bioinform., 2020)

OMGS: Optical Map-Based Genome Scaffolding. - Weihua Pan; Tao Jiang 001; Stefano Lonardi (J. Comput. Biol., 2020)

A novel machine learning framework for automated biomedical relation extraction from large-scale literature repositories. - Lixiang Hong; Jinjian Lin; Shuya Li; Fangping Wan; Hui Yang; Tao Jiang 001; Dan Zhao 004; Jianyang Zeng 001 (Nat. Mach. Intell., 2020)

A simulated annealing approach for resolution guided homogeneous cryo-electron microscopy image selection. - Jie Shi; Xiangrui Zeng; Rui Jiang 001; Tao Jiang 001; Min Xu 009 (Quant. Biol., 2020)

IRIS: A method for predicting in vivo RNA secondary structures using PARIS data. - Jianyu Zhou; Pan Li; Wanwen Zeng; Wenxiu Ma; Zhipeng Lu 002; Rui Jiang 001; Qiangfeng Cliff Zhang; Tao Jiang 001 (Quant. Biol., 2020)

Riboexp: an interpretable reinforcement learning framework for ribosome density modeling. - Hailin Hu 002; Xianggen Liu; An Xiao; Yangyang Li; Chengdong Zhang; Tao Jiang 001; Dan Zhao 004; Sen Song; Jianyang Zeng 001 (Briefings Bioinform., 2021)

DeepLPI: a multimodal deep learning method for predicting the interactions between lncRNAs and protein isoforms. - Dipan Shaw; Hao Chen 097; Minzhu Xie; Tao Jiang 001 (BMC Bioinform., 2021)

Characterizing RNA Pseudouridylation by Convolutional Neural Networks. - Xuan He; Sai Zhang; Yanqing Zhang 010; Zhixin Lei; Tao Jiang 001; Jianyang Zeng 001 (Genom. Proteom. Bioinform., 2021)

Truly Unsupervised Image-to-Image Translation with Contrastive Representation Learning. - Zhiwei Hong; Jianxing Feng; Tao Jiang 001 (ACCV (3), 2022)

DeepRCI: predicting RNA-chromatin interactions via deep learning with multi-omics data. - Yuanpeng Xiong; Xuan He; Dan Zhao 004; Tao Jiang 001; Jianyang Zeng 001 (Quant. Biol., 2023)