Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Issue 2 • April-June 2004

Filter Results

Displaying Results 1 - 10 of 10
  • [Front cover]

    Publication Year: 2004, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (473 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2004, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (67 KB)
    Freely Available from IEEE
  • Introduction of new Associate Editor

    Publication Year: 2004, Page(s): 65
    Request permission for commercial reuse | PDF file iconPDF (51 KB)
    Freely Available from IEEE
  • Prediction of consensus RNA secondary structures including pseudoknots

    Publication Year: 2004, Page(s):66 - 77
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1497 KB) | HTML iconHTML

    Most functional RNA molecules have characteristic structures that are highly conserved in evolution. Many of them contain pseudoknots. Here, we present a method for computing the consensus structures including pseudoknots based on alignments of a few sequences. The algorithm combines thermodynamic and covariation information to assign scores to all possible base pairs, the base pairs are chosen wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The number of recombination events in a sample history: conflict graph and lower bounds

    Publication Year: 2004, Page(s):78 - 90
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB) | HTML iconHTML

    We consider the following problem: Given a set of binary sequences, determine lower bounds on the minimum number of recombinations required to explain the history of the sample, under the infinite-sites model of mutation. The problem has implications for finding recombination hotspots and for the Ancestral Recombination Graph reconstruction problem. Hudson and Kaplan gave a lower bound based on th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A uniform projection method for motif discovery in DNA sequences

    Publication Year: 2004, Page(s):91 - 94
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (313 KB) | HTML iconHTML

    Buhler and Tompa (2002) introduced the random projection algorithm for the motif discovery problem and demonstrated that this algorithm performs well on both simulated and biological samples. We describe a modification of the random projection algorithm, called the uniform projection algorithm, which utilizes a different choice of projections. We replace the random selection of projections by a gr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • [Advertisement]

    Publication Year: 2004, Page(s): 95
    Request permission for commercial reuse | PDF file iconPDF (393 KB)
    Freely Available from IEEE
  • [Advertisement]

    Publication Year: 2004, Page(s): 96
    Request permission for commercial reuse | PDF file iconPDF (407 KB)
    Freely Available from IEEE
  • IEEE/ACM TCBB: Information for authors

    Publication Year: 2004, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (67 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2004, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (473 KB)
    Freely Available from IEEE

Aims & Scope

This bimonthly publishes archival research results related to the algorithmic, mathematical, statistical, and computational methods that are central in bioinformatics and computational biology.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Aidong Zhang, PhD, IEEE Fellow
Dept. of Computer Science and Engineering
State University of New York at Buffalo
Buffalo, New York 14260 USA
azhang@buffalo.edu

Associate Editor-in-Chief
Dong Xu
University of Missouri
xudong@missouri.edu