Xiuzhen Huang

Orcid: 0000-0003-0498-3131

According to our database1, Xiuzhen Huang authored at least 49 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Advancing LGBTQ+ inclusion in STEM education and AI research.
Patterns, 2024

2022
Editorial.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

An Ensemble of U-Net Models for Kidney Tumor Segmentation With CT Images.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

Spatial Pyramid Pooling With 3D Convolution Improves Lung Cancer Detection.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

CrossCas: A Novel Cross-Platform Approach for Predicting Cascades in Online Social Networks with Hidden Markov Model.
Proceedings of the IEEE Global Communications Conference, 2022

Team building without boundaries.
Proceedings of the BCB '22: 13th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics, Northbrook, Illinois, USA, August 7, 2022

NBT (no-boundary thinking): needed to attend to ethical implications of data and AI.
Proceedings of the BCB '22: 13th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics, Northbrook, Illinois, USA, August 7, 2022

2021
Identify differentially expressed genes with large background samples.
Int. J. Comput. Biol. Drug Des., 2021

2020
Detecting Asymmetric Patterns and Localizing Cancers on Mammograms.
Patterns, 2020

2019
Lung cancer screening with low-dose CT scans using a deep learning approach.
CoRR, 2019

2018
Highly accurate model for prediction of lung nodule malignancy with CT scans.
CoRR, 2018

EBIC: an artificial intelligence-based parallel biclustering algorithm for pattern discovery.
CoRR, 2018

EBIC: an evolutionary-based parallel biclustering algorithm for pattern discovery.
Bioinform., 2018

runibic: a Bioconductor package for parallel row-based biclustering of gene expression data.
Bioinform., 2018

EBIC: a next-generation evolutionary-based parallel biclustering method.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

2017
Novel Low Cost 3D Surface Model Reconstruction System for Plant Phenotyping.
J. Imaging, 2017

No-Boundary Thinking in Bioinformatics.
Proceedings of the Biocomputing 2017: Proceedings of the Pacific Symposium, 2017

2016
BinPacker: Packing-Based <i>De Novo</i> Transcriptome Assembly from RNA-seq Data.
PLoS Comput. Biol., 2016

Tensor models: solution methods and applications.
Proceedings of the Big Data over Networks, 2016

2015
Big data - a 21st century science Maginot Line? No-boundary thinking: shifting from the big data paradigm.
BioData Min., 2015

2014
Stochastic k-Tree Grammar and Its Application in Biomolecular Structure Modeling.
Proceedings of the Language and Automata Theory and Applications, 2014

2013
Polynomial kernels collapse the W-hierarchy.
CoRR, 2013

No-boundary thinking in bioinformatics research.
BioData Min., 2013

2012
A Unified Adaptive Co-identification Framework for High-D Expression Data.
Proceedings of the Pattern Recognition in Bioinformatics, 2012

Study of Protein Structure Alignment Problem in Parameterized Computation.
Proceedings of the BIOINFORMATICS 2012 - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms, Vilamoura, Algarve, Portugal, 1, 2012

2011
A New Framework for Co-clustering of Gene Expression Data.
Proceedings of the Pattern Recognition in Bioinformatics, 2011

Graph-based approach for gene markers and applications in next-generation sequencing data analysis.
Proceedings of the ACM International Conference on Bioinformatics, 2011

2010
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results.
Algorithmica, 2010

Analyzing genetic factors involved in recombinant protein expression enhancement.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2010

2008
Parameterized Complexity and Biopolymer Sequence Comparison.
Comput. J., 2008

A practical comparison of two K-Means clustering algorithms.
BMC Bioinform., 2008

Addressing Bio-sequence and Bio-structure Problems.
Proceedings of the International Multisymposiums on Computer and Computational Sciences, 2008

A Relational Approach for Pathway Analysis.
Proceedings of the International Multisymposiums on Computer and Computational Sciences, 2008

2007
Polynomial time approximation schemes and parameterized complexity.
Discret. Appl. Math., 2007

K-Means Clustering Algorithms: Implementation and Comparison.
Proceedings of the Proceeding of the Second International Multi-Symposium of Computer and Computational Sciences (IMSCCS 2007), 2007

Parameterized Graph Problems in Computational Biology.
Proceedings of the Proceeding of the Second International Multi-Symposium of Computer and Computational Sciences (IMSCCS 2007), 2007

2006
Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006

Strong computational lower bounds via parameterized complexity.
J. Comput. Syst. Sci., 2006

On the computational hardness based on linear FPT-reductions.
J. Comb. Optim., 2006

Maximum common subgraph: some upper bound and lower bound results.
BMC Bioinform., 2006

Maximum Common Subgraph: Upper Bound and Lower Bound Results.
Proceedings of the Interdisciplinary and Multidisciplinary Research in Computer Science, 2006

On PTAS for Planar Graph Problems.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Negative-Weight Cycle Algorithms.
Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

Lower Bounds and Parameterized Approach for Longest Common Subsequence.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

Parameterized Computation of LCS for Two Sequences.
Proceedings of the 2006 International Conference on Bioinformatics & Computational Biology, 2006

2005
Tight lower bounds for certain parameterized NP-hard problems.
Inf. Comput., 2005

Efficient Parameterized Algorithm for Biopolymer Structure-Sequence Alignment.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

<i>W</i>-Hardness Under Linear FPT-Reductions: Structural Properties and Further Applications.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Linear FPT reductions and computational lower bounds.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004


  Loading...