Literature DB >> 12511063

Phase4: automatic evaluation of database search methods.

Marc Rehmsmeier1.   

Abstract

It has become standard to evaluate newly devised database search methods in terms of sensitivity and selectivity and to compare them with existing methods. This involves the construction of a suitable evaluation scenario, the execution of the methods, the assessment of their performances, and the presentation of the results. Each of these four phases and their smooth connection usually imposes formidable work. To relieve the evaluator of this burden, a system has been designed with which evaluations can be effected rapidly. It is implemented in the programming language Python whose object-oriented features are used to offer a great flexibility in changing the evaluation design. A graphical user interface is provided which offers the usual amenities such as radio- and checkbuttons or file browsing facilities.

Mesh:

Year:  2002        PMID: 12511063     DOI: 10.1093/bib/3.4.342

Source DB:  PubMed          Journal:  Brief Bioinform        ISSN: 1467-5463            Impact factor:   11.622


  4 in total

1.  Comparative homology agreement search: an effective combination of homology-search methods.

Authors:  Intikhab Alam; Andreas Dress; Marc Rehmsmeier; Georg Fuellen
Journal:  Proc Natl Acad Sci U S A       Date:  2004-09-14       Impact factor: 11.205

Review 2.  Homology and phylogeny and their automated inference.

Authors:  Georg Fuellen
Journal:  Naturwissenschaften       Date:  2008-02-21

3.  A sequence sub-sampling algorithm increases the power to detect distant homologues.

Authors:  Catrióna R Johnston; Denis C Shields
Journal:  Nucleic Acids Res       Date:  2005-07-08       Impact factor: 16.971

4.  Significant speedup of database searches with HMMs by search space reduction with PSSM family models.

Authors:  Michael Beckstette; Robert Homann; Robert Giegerich; Stefan Kurtz
Journal:  Bioinformatics       Date:  2009-10-14       Impact factor: 6.937

  4 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.