Chou, A. and Lu, S., A dynamic programming approach to the study of sequence variations, International Conference on Bioinformatics and Computational Biology (BIOCOMP'08), July 14-17, 2008. PDF
Huang, Z., Chou, A., Mboudjeka, I., , Shen, S., Tanguay, J., Lu, S., and Wang, S., Levels of N-linked glycosylation on the V1 loop of HIV-1 Env Proteins and their relationship to the immunogenicity of HIV Env from primary viral isolates, to appear in the journal Current HIV Research (accepted for publication, April 4, 2008).PDF
Chou, A, Yu, F. and Ko, K., On the complexity of finding the circumscribed rectangles and squares for a two-dimensional domain, Journal of Complexity 22 (2006), pp. 803-817. PDF
Chou, A. and Ko, K., The computational complexity of the distance functions of two-dimensional domains, Theoretical Computer Science, 337 (2005), 360-369. PDF
Chou, A. and Ko, K. On the Complexity of Finding Paths in a Two-Dimensional Domain II: Piecewise Straight-Line Paths,
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis,
August 16-20, 2004, Lutherstadt Wittenberg, Germany.
In Vasco Brattka, Ludwig Staiger, and Klaus Weihrauch,
editors, Proceedings of the 6th Workshop on Computability and
Complexity in Analysis.
Journal version: Electronic Notes in
Theoretical Computer Science 120 (2005), 45-57 (Elsevier, Amsterdam).
PDF
Chou, A. and Ko, K., On the complexity of finding paths in a two-dimensional domain I: shortest paths, Math. Logic Quarterly 50 (2004), 551-572. PDF
Chou, A. and Ko, K., On the complexity of finding shortest paths in a plane domain, Proceedings of International Conference on Computability and Complexity in Analysis, August 28-30, 2003, Cincinnati, USA.
Chou, A. Some complexity issues in Complex Analysis, Proceedings of Conference on Computability and Complexity in Analysis, August 1995, Hagen, Germany. PDF
Chou, A. and Ko, K., Computational complexity of two-dimensional regions, SIAM Journal of Computing 24 (1995), 923-947. PDF
Chou, A. and Ko, K., Some complexity issues on the simply connected regions of the two-dimensional plane, Proceeding of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (STOC) (1993) 1-10. PDF