Tao Jiang
Orcid: 0000-0003-3833-4498Affiliations:
- University of California, Riverside, Department of Computer Science and Engineering, CA, USA
According to our database1,
Tao Jiang
authored at least 234 papers
between 1987 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on cs.ucr.edu
On csauthors.net:
Bibliography
2023
DeepRCI: predicting RNA-chromatin interactions via deep learning with multi-omics data.
Quant. Biol., September, 2023
2022
Truly Unsupervised Image-to-Image Translation with Contrastive Representation Learning.
Proceedings of the Computer Vision - ACCV 2022, 2022
2021
Genom. Proteom. Bioinform., 2021
DeepLPI: a multimodal deep learning method for predicting the interactions between lncRNAs and protein isoforms.
BMC Bioinform., 2021
Riboexp: an interpretable reinforcement learning framework for ribosome density modeling.
Briefings Bioinform., 2021
2020
Quant. Biol., 2020
A simulated annealing approach for resolution guided homogeneous cryo-electron microscopy image selection.
Quant. Biol., 2020
A novel machine learning framework for automated biomedical relation extraction from large-scale literature repositories.
Nat. Mach. Intell., 2020
Quantifying functional impact of non-coding variants with multi-task Bayesian neural network.
Bioinform., 2020
MONN: A Multi-objective Neural Network for Predicting Pairwise Non-covalent Interactions and Binding Affinities Between Compounds and Proteins.
Proceedings of the Research in Computational Molecular Biology, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020
2019
NeoDTI: neural integration of neighbor information from a heterogeneous network for discovering new drug-target interactions.
Bioinform., 2019
Bioinform., 2019
Bioinform., 2019
DIFFUSE: predicting isoform functions from sequences and expression profiles via deep learning.
Bioinform., 2019
2018
Algorithmica, 2018
2017
Proceedings of the Research in Computational Molecular Biology, 2017
2016
SDEAP: a splice graph based differential transcript expression analysis tool for population data.
Bioinform., 2016
H-PoP and H-PoPG: heuristic partitioning algorithms for single individual haplotyping of polyploids.
Bioinform., 2016
2015
Uniformly asymptotic behavior of ruin probabilities in a time-dependent renewal risk model with stochastic return.
J. Comput. Appl. Math., 2015
Differential regulation enrichment analysis via the integration of transcriptional regulatory network and gene expression data.
Bioinform., 2015
Equilibrium analysis for zero-determinant strategy in resource management of wireless network.
Proceedings of the 2015 IEEE Wireless Communications and Networking Conference, 2015
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015
2014
AlignGraph: algorithm for secondary <i>de novo</i> genome assembly guided by closely related references.
Bioinform., 2014
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014
Proceedings of the IEEE Global Communications Conference, 2014
Formal Models and Computability.
Proceedings of the Computing Handbook, 2014
2013
Bioinform., 2013
Bioinform., 2013
2012
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012
BMC Syst. Biol., 2012
A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on a pedigree.
BMC Bioinform., 2012
Detecting genome-wide epistases based on the clustering of relatively frequent items.
Bioinform., 2012
Transcriptome assembly and isoform expression level estimation from biased RNA-Seq reads.
Bioinform., 2012
Algorithms Mol. Biol., 2012
An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants.
Algorithmica, 2012
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012
Workshop: Transcriptome assembly and isoform expression level estimation from biased RNA-Seq reads.
Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012
2011
A Max-Flow-Based Approach to the Identification of Protein Complexes Using Protein Interaction and Microarray Data.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011
J. Comput. Biol., 2011
Inferring Haplotypes from genotypes on a Pedigree with mutations, genotyping Errors and Missing Alleles.
J. Bioinform. Comput. Biol., 2011
Improving Probe Set Selection for Microbial Community Analysis by Leveraging Taxonomic Information of Training Sequences.
BMC Bioinform., 2011
Uncover disease genes by maximizing information flow in the phenome-interactome network.
Bioinform., 2011
Separating Metagenomic Short Reads into Genomes via Clustering - (Extended Abstract).
Proceedings of the Algorithms in Bioinformatics - 11th International Workshop, 2011
IsoLasso: A LASSO Regression Approach to RNA-Seq Based Transcriptome Assembly - (Extended Abstract).
Proceedings of the Research in Computational Molecular Biology, 2011
Workshop: Transcriptome assembly from RNA-Seq data: Objectives, algorithms and challenges.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011
2010
A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops.
J. Comb. Optim., 2010
Efficient Genome-Wide TagSNP Selection Across Populations via the Linkage Disequilibrium Criterion.
J. Comput. Biol., 2010
BMC Bioinform., 2010
MSOAR 2.0: Incorporating tandem duplications into ortholog assignment based on genome rearrangement.
BMC Bioinform., 2010
Accelerated similarity searching and clustering of large compound sets by geometric embedding and locality sensitive hashing.
Bioinform., 2010
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010
Proceedings of the 10th IEEE International Conference on Bioinformatics and Bioengineering, 2010
2009
Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigree Based on Fast Elimination of Redundant Linear Equations.
SIAM J. Comput., 2009
J. Comput. Sci. Technol., 2009
BMC Bioinform., 2009
An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract).
Proceedings of the Algorithms, 2009
Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract).
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
J. Comput. Syst. Sci., 2008
An Efficient Voting Algorithm for Finding Additive Biclusters with Random Background.
J. Comput. Biol., 2008
J. Bioinform. Comput. Biol., 2008
W-AlignACE: an improved Gibbs sampling algorithm based on more accurate position weight matrices learned from sequence and gene expression/ChIP-chip data.
Bioinform., 2008
A maximum common substructure-based algorithm for searching and predicting drug-like compounds.
Proceedings of the Proceedings 16th International Conference on Intelligent Systems for Molecular Biology (ISMB), 2008
Proceedings of the Combinatorial Pattern Matching, 19th Annual Symposium, 2008
2007
Complexity and approximation of the minimum recombinant haplotype configuration problem.
Theor. Comput. Sci., 2007
J. Comput. Biol., 2007
J. Bioinform. Comput. Biol., 2007
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility.
Inf. Process. Lett., 2007
Study of gene function based on spatial co-expression in a high-resolution mouse brain atlas.
BMC Syst. Biol., 2007
Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007
2006
IEEE Trans. Neural Networks, 2006
Theor. Comput. Sci., 2006
J. Bioinform. Comput. Biol., 2006
OligoSpawn: a software tool for the design of overgo probes from large unigene datasets.
BMC Bioinform., 2006
Proceedings of the Research in Computational Molecular Biology, 2006
Understanding microbial genomic structures and applications to biological pathway inference.
Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006
2005
IEEE ACM Trans. Comput. Biol. Bioinform., 2005
IEEE Trans. Broadcast., 2005
Computing the Minimum Recombinant Haplotype Configuration from Incomplete Genotype Data on a Pedigree by Integer Linear Programming.
J. Comput. Biol., 2005
A Class of Edit Kernels for SVMs to Predict Translation Initiation Sites in Eukaryotic mRNAs.
J. Comput. Biol., 2005
J. Comput. Biol., 2005
A software system for gene sequence database construction based on fast approximate string matching.
Int. J. Bioinform. Res. Appl., 2005
Bioinform., 2005
Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Companding technique for PAPR reduction in OFDM systems based on an exponential function.
Proceedings of the Global Telecommunications Conference, 2005. GLOBECOM '05, St. Louis, Missouri, USA, 28 November, 2005
Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference, 2005
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005
Proceedings of the Theory of Computing 2005, 2005
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005
2004
J. Discrete Algorithms, 2004
J. Comb. Optim., 2004
Clustering Binary Fingerprint Vectors with Missing Values for DNA Array Data Analysis.
J. Comput. Biol., 2004
Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme.
J. Algorithms, 2004
Bioinform., 2004
An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming.
Proceedings of the Eighth Annual International Conference on Computational Molecular Biology, 2004
Computational Construction of Nitrogen Assimilation Pathway in Cyanobacteria Synechococcus sp. WH8102.
Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004
Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004
2003
Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem.
J. Sched., 2003
Computational Assignment of Protein Backbone Nmr Peaks Byefficient Bounding and Filtering.
J. Bioinform. Comput. Biol., 2003
J. Bioinform. Comput. Biol., 2003
Bioinform., 2003
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003
Proceedings of the Sventh Annual International Conference on Computational Biology, 2003
Statistical Validation of Compound Structure-Selectivity Relationship Using NCI Cancer Database.
Proceedings of the International Conference on Mathematics and Engineering Techniques in Medicine and Biological Scienes, 2003
Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference, 2003
2002
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
J. Comput. Syst. Sci., 2002
J. Comput. Syst. Sci., 2002
Comput. Sci. Eng., 2002
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
Identifying transcription factor binding sites through Markov chain optimization.
Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002
An Efficient Branch-and-Bound Algorithm for the Assignment of Protein Backbone NMR Peaks.
Proceedings of the 1st IEEE Computer Society Bioinformatics Conference, 2002
2001
J. Comb. Optim., 2001
Probe selection algorithms with applications in the analysis of microbial communities.
Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, 2001
An efficient algorithm for finding short approximate non-tandem repeats.
Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, 2001
2000
A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application.
SIAM J. Comput., 2000
SIAM J. Comput., 2000
J. Comput. Sci. Technol., 2000
Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
Proceedings of the Algorithms and Computation, 11th International Conference, 2000
Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000
1999
Algorithmica, 1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Proceedings of the Algorithms, 1999
Proceedings of the Discrete Mathematical Problems with Medical Applications, 1999
Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999
Some Examples of Average-case Analysis by the Imcompressibility Method.
Proceedings of the Jewels are Forever, 1999
Proceedings of the Algorithms and Theory of Computation Handbook., 1999
Proceedings of the Algorithms and Theory of Computation Handbook., 1999
Proceedings of the Algorithms and Theory of Computation Handbook., 1999
1998
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998
Proceedings of the Combinatorial Pattern Matching, 9th Annual Symposium, 1998
1997
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997
Proceedings of the First Annual International Conference on Research in Computational Molecular Biology, 1997
Shortest common superstrings.
Proceedings of the Pattern Matching Algorithms, 1997
Formal Models and Computability.
Proceedings of the Computer Science and Engineering Handbook, 1997
1996
Algorithmica, 1996
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996
1995
Theor. Comput. Sci., 1995
On the Approximation of Shortest Common Supersequences and Longest Common Subsequences.
SIAM J. Comput., 1995
Proceedings of the STACS 95, 1995
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995
1994
Some Results Concerning 2-D On-Line Tessellation Acceptors and 2-D Alternating Finite Automata.
Theor. Comput. Sci., 1994
Inf. Process. Lett., 1994
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994
Proceedings of the Results and Trends in Theoretical Computer Science, 1994
1993
J. Algorithms, 1993
On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages.
Int. J. Found. Comput. Sci., 1993
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993
1992
Inf. Comput., April, 1992
A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars.
Theor. Comput. Sci., 1992
IEEE Trans. Computers, 1992
1991
Inf. Process. Lett., 1991
Int. J. Found. Comput. Sci., 1991
1990
J. VLSI Signal Process., 1990
On the Complexity of 1-Tape ATMs and Off-line 1-Tape ATMs Running in Constant Reversals.
Theor. Comput. Sci., 1990
Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990
Proceedings of the Advances in Computing and Information, 1990
1989
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
1988
Theor. Comput. Sci., 1988
Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987