Bioinformatics Algorithms: Techniques and Applications

Wiley Book Series on Bioinformatics
(Series Editors: Yi Pan and Albert Y. Zomaya)


Editors' Contact Information

Ion Mandoiu
Computer Science & Engineering Department
University of Connecticut
Storrs, CT 06269-2155, USA
Phone: (860) 486-3784
Fax: (815) 301-8557
Email: ion@engr.uconn.edu

Alexander Zelikovsky
Department of Computer Science
Georgia State University
Atlanta, GA 30302-4110, USA
Phone: (404) 651-0676
Fax: (815) 642-0052
Email: alexz@cs.gsu.edu


Schedule

  • First draft of chapters: August 15, 2006
  • Final version of chapters: November 15, 2006 December 20, 2006
  • Final book manuscript: January 15, 2007
  • Tentative publication date: Spring 2007

Copyrights and Permissions

If your chapter includes copyrighted material, please use the form below to obtain permission from the publisher (see the Wiley copyright guidelines on what types of material require permission). Keep copies of signed permission forms, fax a copy to +1-815-301-8557, and mail the originals to Ion Mandoiu, Computer Science & Engineering Department, University of Connecticut, 371 Fairfield Rd., Unit 2155, Storrs, CT 06269-2155, USA.

Formatting Instructions

Chapters should be 20-25 pages (including the text, tables and figures) when formatted as the sample chapter (approximately 500 words per page). If the length requirement poses a problem, please contact one of the editors.

Contents

  1. Brona Brejova (Cornell University), Daniel G. Brown, and Tomas Vinar (University of Waterloo), Advances in Hidden Markov Models for Sequence Annotation.
  2. Teresa M. Przytycka and Elena Zotenko (NCBI), Graph theoretical approaches to delineate dynamics of biological processes.
  3. Sudha Balla and Sanguthevar Rajasekaran (University of Connecticut), Sorting and FFT Based Techniques in the Discovery of Biopatterns.
  4. Anne Bergeron, Cedric Chauve and Yannick Gingras (UQAM), Formal models of gene clusters.
  5. Sven Rahmann (Universitšt Bielefeld), Integer Linear Programming Formulations for Approximate Gene Cluster Discovery
  6. Daniel G. Brown (University of Waterloo), A survey of seeding for sequence alignment.
  7. Yuzhen Ye (The Burnham Institute) and Haixu Tang (Indiana University), Dynamic programming algorithms for sequence and structure comparison.
  8. Sing-Hoi Sze (Texas A&M), Recent developments in sequence alignment and motif finding
  9. Bhaskar DasGupta (UIC) and Ming-Yang Kao (Northwestern University), Efficient combinatorial algorithms for DNA sequence processing.
  10. Raja Jothi and Teresa Przytycka (NCBI), Computational approaches to predict protein-protein and domain-domain interactions.
  11. Sven Rahmann (Universitšt Bielefeld), Algorithms for Microarray Layout.
  12. Kishori Konwar, Ion Mandoiu, Alex Russell, and Alex Shvartsman (University of Connecticut), Exact and Approximation Algorithms for Multiplex PCR Primer Set Selection with Amplification Length Constraints
  13. Yi Shi, Zhipeng Cai, and Guohui Lin (University of Alberta), Classification accuracy based microarray missing value imputation.
  14. Saumyadipta Pyne (MIT), Steve Skiena, and Bruce Futcher (State University of New York at Stony Brook), Meta-analysis of microarray data.
  15. Paola Bonizzoni (Universita Degli Studi di Milano-Bicocca), Gianluca Della Vedova (Universita Degli Studi di Milano-Bicocca), Riccardo Dondi (Universita Degli Studi di Bergamo), and Giancarlo Mauri (Universita Degli Studi di Milano-Bicocca), The comparison of phylogenetic networks: algorithms and complexity.
  16. Steven Orzack (The Fresh Pond Research Institute) and Dan Gusfield (UC Davis), Comparative performance of haplotyping algorithms.
  17. Pasi Rastas, Mikko Koivisto, Heikki Mannila, and Esko Ukkonen (University of Helsinki), Phasing genotypes using a hidden Markov model.
  18. Dumitru Brinza, Jingwu He, and Alexander Zelikovsky (Georgia State University), Optimization methods for genotype data analysis in epidemiological studies.
  19. Hao Wang, Patra Volarath, and Robert W Harrison (Georgia State University), Efficient Algorithms for Structural Recall in Databases.
  20. Sergey Bereg (University of Texas at Dallas), Topological Indices in Combinatorial Chemistry.