## Research InterestsThe research foci of our group are currently on parallel algorithms, parallel computation,computational biology and bioinformatics. In general, we are interested in investigating research issues resulting from computation/communication/data intensive problems in computer science and biomedical domains, with an emphasis on providing efficient solutions on modern parallel computing platforms such as the clusters and the grids, as well as analyzing the costs/complexities on theoretical parallel models such as the BSP. ## Research GroupCurrent graduate student members (in alphabetical order):- Mr. Min Qian (MS)
- Mr. Jun Song (PhD)
- Dr. Wangang Xie (MS)
- Mr. Longde Yin (PhD)
## Recent Invited TalksA briefing on our research work was given as an invited talk on Apr. 30, 2004 at theYale University High Performance Computing Symposium, with abstract available here. ## Ongoing WorkListed below are some of our ongoing work.- Parallel Data Mining of
Bayesian Networks from Gene Expression Data
Poster Book of the*8-th Annual Int'l Conference on Research in Computational*, 122-123. Molecular Biology (RECOMB 2004) - Cooperative Biomedical
Knowledge Inference
Poster Book of the*8-th Annual Int'l Conference on Research in Computational*, 556-557. Molecular Biology (RECOMB 2004)
## PublicationsSome complete recent work of our group are as below.-
2005
- Exact Algorithms for Motif Search
*Proc. of 3rd Asia-Pacific Bioinformatics Conference (APBC)*, Singapore. (to appear) (with S. Rajasekaran, S. Balla, V. Thapar, M. Gryk, M. Maciejewski and M. Schiller) - Exact Algorithms for Planted Motif Challenge Problems
*Proc. of 3rd Asia-Pacific Bioinformatics Conference (APBC)*, Singapore. (to appear) (with S. Rajasekaran and S. Balla) - Toward a Distributed UMLS
*Proc. of 2nd Biological Language Conference (BLC)*, Carnegie-Mellon University, 77-78. - Toward Cooperative Genomic Knowledge Inference
*Parallel Computing Journal*, 30(9-10):1127-1135. (with C.-W. Lee) -
A Randomized Algorithm for Distance Matrix Calculations in
Multiple Sequence
Alignment,*First Int'l Conference on Knowledge Exploration in Life Science*, LNAI 3303:33-45, Springer-Verlag, 2004. Informatics (KELSI) (with S. Rajasekaran, V. Thapar and H. Dave) - High-Performance Parallel Bio-computing
*Parallel Computing Journal*, 30(9-10):999-1000. (with S. Rajasekaran) - Biomedical Computations on the Grid -
Organizing Chairs' Note
*Proc. of the 4-th IEEE/ACM Symposium on Cluster Computing and the Grid (CCGrid)*, published in CD-ROM. (with S. Rajasekaran) - Second BioGrid Workshop - Finding Hamiltonian Paths in Tournaments on Clusters
*Journal of Cluster Computing*, accepted. (with X. He and L. Yang and S. Rajasekaran) -
Distributed Path-Based Inference in Semantic Networks
*Proc. of 7th IEEE Int'l Symp. on Parallel Architectures, Algorithms and Networks (I-SPAN)*, 232-237. (with C.-W. Lee, S. Rajasekaran, L. Yang and D. Frank Hsu) -
Distributed Path-Based Inference in Semantic Networks
*Journal of Supercomputing, 29(2):211-227*. (with C.-W. Lee, L. Yang and S. Rajasekaran) -
TROJAN: A Scalable Parallel Semantic
Network System
*Proc. of 15th IEEE Int'l Conference on Tools with Artificial Intelligence (ICTAI),* 219-223. (with C.-W. Lee and S. Rajasekaran) -
Parallel Pattern Identification in
Biological Sequences on Clusters
*IEEE Transactions on NanoBioscience, 2(1):29-34.*(with S. Rajasekaran) -
Average-Case Communication-Optimal
Parallel Parenthesis Matching
Proc. of the*13th Int'l Symp. on Algorithms and Computation (ISAAC),* LNCS 2518:308-319, Springer-Verlag, 2002. (with X. He) -
Parallel Pattern Identification in
Biological Sequences on Clusters
Proc. of the 4th*IEEE International Conference on Cluster Computing (IEEE Cluster)*, 127-134, 2002. -
Finding Double Euler Trails of Planar Graphs in Linear Time
*SIAM Journal on Computing, 31(4):1255-1285.*(with Z.Z. Chen and Xin He) -
Grid-Enabled Parallel Divide-And-Conquer -- Theory and Practice
Proc. of the 17th*ACM SIGAPP Symposium on Applied Computing (SAC)*, 865-869, 2002. -
Communication-Efficient BSP Algorithm for All Nearest Smaller Values
Problem
*Journal of Parallel and Distributed Computing, 61:1425-1438*. (with Xin He) -
Finding Hamiltonian Paths in Tournaments on
Clusters - A Communication-Efficient Approach
Proc. of the 16th*ACM SIGAPP Symposium on Applied Computing (SAC)*, 549-553. (with Xin He) -
Parallel Range Searching in Large Databases
Based on General Parallel Prefix Computation
Proc. of the 10th*SIAM Conference on Parallel Processing for Scientific Computing*, 3 pages.(with Xin He) -
Communication-Efficient Bulk
Synchronous Parallel Algorithm for Parentheses Matching
Proc. of the 10th*SIAM Conference on Parallel Processing for Scientific Computing*, 9 pages.(with Xin He) 2000 -
Scalable Coarse Grained Parallel Interval Graph Algorithms
Proc. of the*Int'l Conference on Parallel and Distributed Processing Techniques and Applications*, 2000, 1369-1376, (with Xin He) (PDPTA) - Communication-Efficient Coarse-Grained Parallel Algorithm for All
Nearest Smaller Values
Problem and its Applications Proc. of the*Int'l Conference on Parallel and Distributed Processing Techniques and Applications*, 2000, 1377-1384, (with Xin He) (PDPTA) -
Finding Double Euler Trails of Planar Graphs in Linear Time
Proc. of the 40th*IEEE Symposium on Foundations of Computer Science (FOCS)*, 319-329. (with Z.Z. Chen and Xin He)
2004 2003 2002 2001 1999
Chun-Hsi (Vincent) Huang (huang@cse.uconn.edu) |