jiang
minghui
minghui jiang
Assistant Professor
@
mjiang     
cc.usu.edu
Department of Computer Science
Utah State University
4205 Old Main Hill
Logan, Utah 84322-4205 		Phone: 435-797-0347
Fax: 435-797-3265
Office: Main 402G

Fall 2008 Office Hours: Tue Thu 12:00-13:30

Courses

Research Interests

I am looking for graduate students to work with me on exciting research projects. Financial support is available. Contact me if interested.

Journal Publications

  1. Minghui Jiang. Approximation algorithms for predicting RNA secondary structures with arbitrary pseudoknots. IEEE/ACM Transactions on Computational Biology and Bioinformatics, accepted October 21, 2008, to appear. [paper]
  2. Sergey Bereg, Adrian Dumitrescu, and Minghui Jiang. Maximum area independent sets in disk intersection graphs. International Journal of Computational Geometry and Applications, accepted March 1, 2008, to appear. [paper]
  3. Sergey Bereg, Ovidiu Daescu, and Minghui Jiang. A PTAS for cutting out polygons with lines. Algorithmica, doi:10.1007/s00453-008-9182-2, online first March 29, 2008, to appear. [paper]
  4. Minghui Jiang, James Anderson, Joel Gillespie, and Martin Mayne. uShuffle: a useful tool for shuffling biological sequences while preserving the k-let counts. BMC Bioinformatics, 9:#192, 2008. [paper] [supplementary information]
  5. Minghui Jiang, Ying Xu, and Binhai Zhu. Protein structure-structure alignment with discrete Frechet distance. Journal of Bioinformatics and Computational Biology, 6:51-64, 2008. [paper]
  6. Adrian Dumitrescu and Minghui Jiang. On a covering problem for equilateral triangles. Electronic Journal of Combinatorics, 15:#R37, 2008. [paper]
  7. Minghui Jiang. On the sum of distances along a circle. Discrete Mathematics, 308:2038-2045, 2008. [paper]
  8. Minghui Jiang. A linear-time algorithm for Hamming distance with shifts. Theory of Computing Systems, doi:10.1007/s00224-007-9088-4, online first October 06, 2007, to appear. [paper]
  9. Minghui Jiang. On finding a large number of 3D points with a small diameter. Discrete Applied Mathematics, 155:2355-2361, 2007. [paper]
  10. Minghui Jiang and Joel Gillespie. Engineering the divide-and-conquer closest pair algorithm. Journal of Computer Science and Technology, 22:532-540, 2007. [paper] [supplementary information]
  11. Minghui Jiang. A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem. Journal of Combinatorial Optimization, Special Issue on Bioinformatics, 13:217-221, 2007. [paper]
  12. Minghui Jiang. A new approximation algorithm for labeling points with circle pairs. Information Processing Letters, 99:125-129, 2006. [paper]
  13. Binhai Zhu and Minghui Jiang. A combinatorial theorem for labeling squares with points and its application. Journal of Combinatorial Optimization, 11:411-420, 2006. [paper]
  14. Minghui Jiang. Approximating minimum coloring and maximum independent set in dotted interval graphs. Information Processing Letters, 98:29-33, 2006. [paper]
  15. Minghui Jiang and Binhai Zhu. Protein folding on the hexagonal lattice in the HP model. Journal of Bioinformatics and Computational Biology, 3:19-34, 2005. [paper] [supplementary information]
  16. Minghui Jiang. UPS-k: a set partitioning problem with applications in UPS pickup-delivery system. Information Processing Letters, 93:173-175, 2005. [paper]
  17. Nicholas J. Giordano and Minghui Jiang. Physical modeling of the piano. EURASIP Journal on Applied Signal Processing, 2004:926-933, 2004. [paper]
  18. Minghui Jiang, Jianbo Qian, Zhongping Qin, Binhai Zhu, and Robert Cimikowski. A simple factor-3 approximation for labeling points with circles. Information Processing Letters, 87:101-105, 2003. [paper]

Conference Publications

  1. Adrian Dumitrescu and Minghui Jiang. Sweeping points. In Proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'08), volume 5171 of Lecture Notes in Computer Science, pages 63-76, Springer-Verlag, August 25-27, 2008. [paper] [slides] [slides6]
  2. Zhixiang Chen, Bin Fu, Minghui Jiang, and Binhai Zhu. On recovering syntenic blocks from comparative maps. In Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications (COCOA'08), volume 5165 of Lecture Notes in Computer Science, pages 319-327, Springer-Verlag, August 21-24, 2008. [paper]
  3. Adrian Dumitrescu and Minghui Jiang. Monochromatic simplices of any volume. In Proceedings of the 20th Canadian Conference on Computational Geometry (CCCG'08), pages 71-74, August 13-15, 2008. [paper]
  4. Sergey Bereg, Adrian Dumitrescu, and Minghui Jiang. On covering problems of Rado. In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT'08), volume 5124 of Lecture Notes in Computer Science, pages 294-305, Springer-Verlag, July 2-4, 2008. [paper] [slides] [slides6]
  5. Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, and Binhai Zhu. Simplifying 3D polygonal chains under the discrete Frechet distance. In Proceedings of the 8th Latin American Symposium on Theoretical Informatics (LATIN'08), volume 4957 of Lecture Notes in Computer Science, pages 630-641, Springer-Verlag, April 7-11, 2008. [paper] [slides] [slides6]
  6. Minghui Jiang. A PTAS for the weighted 2-interval pattern problem over the preceding-and-crossing model. In Proceedings of the 1st Annual International Conference on Combinatorial Optimization and Applications (COCOA'07), volume 4616 of Lecture Notes in Computer Science, pages 378-387, Springer-Verlag, August 12-15, 2007. [paper] [slides] [slides6]
  7. Minghui Jiang and Vladimir Kulyukin. Connect-the-dots in a graph and Buffon's needle on a chessboard: two problems in assisted navigation. In Proceedings of the 10th Joint Conference on Information Sciences / the 10th International Conference on Computer Science and Informatics (JCIS/CSI'07), pages 713-719, July 18-24, 2007. [paper] [slides] [slides6]
  8. Vladimir Kulyukin, Aliasgar Kutiyanawala, and Minghui Jiang. Surface-embedded passive RF exteroception: Kepler, Greed, and Buffon's needle. In Proceedings of the 4th International Conference on Ubiquitous Intelligence and Computing (UIC'07), volume 4611 of Lecture Notes in Computer Science, pages 33-42, Springer-Verlag, July 11-13, 2007. [paper]
  9. Minghui Jiang, James Anderson, Joel Gillespie, and Martin Mayne. uShuffle: a useful tool for shuffling biological sequences while preserving the k-let counts. In Proceedings of the 2007 International Conference on Bioinformatics and Computational Biology (BIOCOMP'07), volume II, pages 605-613, CSREA Press, June 25-28, 2007. [paper] [supplementary information]
  10. Minghui Jiang. Improved approximation algorithms for predicting RNA secondary structures with arbitrary pseudoknots. In Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management (AAIM'07), volume 4508 of Lecture Notes in Computer Science, pages 399-410, Springer-Verlag, June 6-8, 2007. [paper] [slides] [slides6]
  11. Minghui Jiang, Martin Mayne, and Joel Gillespie. Delta: a toolset for the structural analysis of biological sequences on a 3D triangular lattice. In Proceedings of the 2007 International Symposium on Bioinformatics Research and Applications (ISBRA'07), volume 4463 of Lecture Notes in Bioinformatics, pages 518-529, Springer-Verlag, May 7-10, 2007. [paper] [supplementary information]
  12. Minghui Jiang, Ying Xu, and Binhai Zhu. Protein structure-structure alignment with discrete Frechet distance. In Proceedings of the 5th Asia Pacific Bioinformatics Conference (APBC'07), pages 131-141, Imperial College Press, January 14-17, 2007. [paper] [supplementary information]
  13. Chaitanya Gharpure, Vladimir Kulyukin, Minghui Jiang, and Aliasgar Kutiyanawala. Passive radio frequency exteroception in robot assisted shopping for the blind. In Proceedings of the 3rd International Conference on Ubiquitous Intelligence and Computing (UIC'06), volume 4159 of Lecture Notes in Computer Science, pages 51-60, Springer-Verlag, September 3-6, 2006. [paper]
  14. Sergey Bereg, Ovidiu Daescu, and Minghui Jiang. A PTAS for cutting out polygons with lines. In Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON'06), volume 4112 of Lecture Notes in Computer Science, pages 176-185, Springer-Verlag, August 15-18, 2006. [paper]
  15. Minghui Jiang. Subsequence packing: complexity, approximation, and application. In Proceedings of the 2nd International Conference on Algorithmic Aspects in Information and Management (AAIM'06), volume 4041 of Lecture Notes in Computer Science, pages 314-323, Springer-Verlag, June 20-22, 2006. [paper]
  16. Minghui Jiang, Sergey Bereg, Zhongping Qin, and Binhai Zhu. New bounds on map labeling with circular labels. In Proceedings of the 15th Annual International Symposium on Algorithms and Computation (ISAAC'04), volume 3341 of Lecture Notes in Computer Science, pages 606-617, Springer-Verlag, 2004. [paper]
  17. Sergey Bereg, Minghui Jiang, and Binhai Zhu. Contour interpolation with bounded dihedral angles. In Proceedings of the 9th ACM Symposium on Solid Modeling and Applications (SM'04), pages 303-308, 2004. [paper]
  18. Minghui Jiang, Brendan Mumey, Zhongping Qin, Andrew Tomascak, and Binhai Zhu. Approximations for two decomposition-based geometric optimization problems. In Proceedings of the 2004 International Conference on Computational Science and its Applications (ICCSA'04), volume 3045 of Lecture Notes in Computer Science, pages 90-98, Springer-Verlag, 2004. [paper]
  19. Nicholas J. Giordano, Minghui Jiang, and Stu Dietz. Experimental and computational studies of the piano. In Proceedings of the 17th International Congress on Acoustics, volume 4, 2001. [paper]

Computer Programs

Minghui Jiang © 2005-2008     Last modified: Sun Nov 9 08:58:34 MST 2008