Publications

• A Case Study in Genome-Level Fragment Assembly. (Ting Chen and Steven Skiena).
  To appear at Bioinformatics, 2000.
  
  
• A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry. (Ting Chen, Ming-Yang Kao, Matthew Tepel, John Rush and George Church).
  The 11th Annual SIAM-ACM Symposium on Discrete Algorithms (SODA 2000), page 389-398, 2000.
  
  
• On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees. (Ting Chen and Ming-Yang Kao).
  The 7th Annual European Symposium on Algorithms (ESA'99), Page 248-256, 1999.
  LNCS, Lecture Notes in Computer Science, Springer-Verlag.
  
  
• Identifying gene regulartory networks from experimental data. (Ting Chen, Vladimir Filkov and Steven S. Skiena).
  ACM-SIGACT The Third Annual International Conference on Computational Moledular Biology (RECOMB99), page 94-103, 1999.
  
  
• Modeling Gene Expression with Differential Equations. (Ting Chen, Hongyu L. He, and George M. Church).
  Pacific Symposium on Biocomputing (PSB99), Page 29-40, 1999.
  
  
• Pombe: A Fission Yeast gene-finding and exon-intron structure prediction system. (Ting Chen and Michael Q. Zhang).
  Yeast, Vol. 14: 701-710, 1998.
  
  
• Trie-based data structures for fragment assembly, (Ting Chen and Steven S. Skiena).
  The Eighth Symposium on Combinatorial Pattern Matching (CPM97), page 206-223, 1997.
  
  
• Sorting with fixed-length reversals. (Ting Chen and Steven Skiena).
  Journal of Discrete Applied Mathematics, Special Volume on Computational Molecular Biology, page 269-296, vol.71, December 5 1996.
  
  
• Computational Genome Analysis(Ting Chen). PHD Thesis, 1997.
  
  
• How Good is Genome-Level Fragment Assembly? (Ting Chen and Steven Skiena).
  Technical Report 1997.
  
  
• Incremental Model Checking in the Modal Mu-Calculus. (with Oleg Sokolsky and Scott Smolka).
  1996. Technical Report.

back to Tim Chen's home page.