The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Brona Brejová: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Therese C. Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar
    Finding Hidden Independent Sets in Interval Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:182-191 [Conf]
  2. Brona Brejová, Daniel G. Brown, Ian M. Harrower, Alejandro López-Ortiz, Tomás Vinar
    Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:1-10 [Conf]
  3. Brona Brejová, Daniel G. Brown, Ian M. Harrower, Tomás Vinar
    New Bounds for Motif Finding in Strong Instances. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:94-105 [Conf]
  4. Brona Brejová, Daniel G. Brown, Tomás Vinar
    Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions. [Citation Graph (0, 0)][DBLP]
    CPM, 2003, pp:42-54 [Conf]
  5. Brona Brejová, Tomás Vinar
    A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:190-202 [Conf]
  6. Brona Brejová, Daniel G. Brown, Ming Li, Tomás Vinar
    ExonHunter: a comprehensive approach to gene finding. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2005, pp:57-65 [Conf]
  7. Therese C. Biedl, Brona Brejová, Tomás Vinar
    Simplifying Flow Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:192-201 [Conf]
  8. Brona Brejová, Daniel G. Brown, Tomás Vinar
    Vector Seeds: An Extension to Spaced Seeds Allows Substantial Improvements in Sensitivity and Specifity. [Citation Graph (0, 0)][DBLP]
    WABI, 2003, pp:39-54 [Conf]
  9. Brona Brejová, Daniel G. Brown, Tomás Vinar
    Optimal DNA Signal Recognition Models with a Fixed Amount of Intrasignal Dependency. [Citation Graph (0, 0)][DBLP]
    WABI, 2003, pp:78-94 [Conf]
  10. Brona Brejová, Daniel G. Brown, Tomás Vinar
    The Most Probable Labeling Problem in HMMs and Its Application to Bioinformatics. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:426-437 [Conf]
  11. Brona Brejová
    Analyzing variants of Shellsort. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:5, pp:223-227 [Journal]
  12. Brona Brejová, Daniel G. Brown, Tomás Vinar
    Optimal Spaced Seeds for Homologous Coding Regions. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2004, v:1, n:4, pp:595-610 [Journal]
  13. Brona Brejová, Daniel G. Brown, Tomás Vinar
    Vector seeds: An extension to spaced seeds. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:3, pp:364-380 [Journal]
  14. Therese C. Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar
    Finding hidden independent sets in interval graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:310, n:1-3, pp:287-307 [Journal]
  15. Rastislav Srámek, Brona Brejová, Tomás Vinar
    On-Line Viterbi Algorithm for Analysis of Long Biological Sequences. [Citation Graph (0, 0)][DBLP]
    WABI, 2007, pp:240-251 [Conf]
  16. Rastislav Srámek, Brona Brejová, Tomás Vinar
    On-line Viterbi Algorithm and Its Relationship to Random Walks [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  17. Brona Brejová, Daniel G. Brown, Tomás Vinar
    The most probable annotation problem in HMMs and its application to bioinformatics. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:7, pp:1060-1077 [Journal]

  18. The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection. [Citation Graph (, )][DBLP]


  19. Homology search for genes. [Citation Graph (, )][DBLP]


  20. Reconstructing Histories of Complex Gene Clusters on a Phylogeny. [Citation Graph (, )][DBLP]


  21. Predicting Gene Structures from Multiple RT-PCR Tests. [Citation Graph (, )][DBLP]


  22. Bayesian History Reconstruction of Complex Human Gene Clusters on a Phylogeny [Citation Graph (, )][DBLP]


  23. The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002