These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

130 related articles for article (PubMed ID: 9088708)

  • 1. Reduced space sequence alignment.
    Grice JA; Hughey R; Speck D
    Comput Appl Biosci; 1997 Feb; 13(1):45-53. PubMed ID: 9088708
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Parallel sequence alignment in limited space.
    Grice JA; Hughey R; Speck D
    Proc Int Conf Intell Syst Mol Biol; 1995; 3():145-53. PubMed ID: 7584431
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Reduced space hidden Markov model training.
    Tarnas C; Hughey R
    Bioinformatics; 1998 Jun; 14(5):401-6. PubMed ID: 9682053
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A linear memory algorithm for Baum-Welch training.
    Miklós I; Meyer IM
    BMC Bioinformatics; 2005 Sep; 6():231. PubMed ID: 16171529
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Optimizing reduced-space sequence analysis.
    Wheeler R; Hughey R
    Bioinformatics; 2000 Dec; 16(12):1082-90. PubMed ID: 11159327
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure.
    Eddy SR
    BMC Bioinformatics; 2002 Jul; 3():18. PubMed ID: 12095421
    [TBL] [Abstract][Full Text] [Related]  

  • 7. A space-efficient algorithm for the constrained pairwise sequence alignment problem.
    He D; Arslan AN
    Genome Inform; 2005; 16(2):237-46. PubMed ID: 16901106
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Implementing EM and Viterbi algorithms for Hidden Markov Model in linear memory.
    Churbanov A; Winters-Hilt S
    BMC Bioinformatics; 2008 Apr; 9():224. PubMed ID: 18447951
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Searching for distantly related protein sequences in large databases by parallel processing on a transputer machine.
    Vogt G; Argos P
    Comput Appl Biosci; 1992 Feb; 8(1):49-55. PubMed ID: 1568125
    [TBL] [Abstract][Full Text] [Related]  

  • 10. A memory-efficient algorithm for multiple sequence alignment with constraints.
    Lu CL; Huang YP
    Bioinformatics; 2005 Jan; 21(1):20-30. PubMed ID: 15374876
    [TBL] [Abstract][Full Text] [Related]  

  • 11. A space-efficient algorithm for three sequence alignment and ancestor inference.
    Yue F; Tang J
    Int J Data Min Bioinform; 2009; 3(2):192-204. PubMed ID: 19517989
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Dynamic programming algorithms for biological sequence comparison.
    Pearson WR; Miller W
    Methods Enzymol; 1992; 210():575-601. PubMed ID: 1584052
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A tutorial of techniques for improving standard Hidden Markov Model algorithms.
    Golod D; Brown DG
    J Bioinform Comput Biol; 2009 Aug; 7(4):737-54. PubMed ID: 19634201
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Improved Hidden Markov Model training for multiple sequence alignment by a particle swarm optimization-evolutionary algorithm hybrid.
    Rasmussen TK; Krink T
    Biosystems; 2003 Nov; 72(1-2):5-17. PubMed ID: 14642655
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Parallel hardware for sequence comparison and alignment.
    Hughey R
    Comput Appl Biosci; 1996 Dec; 12(6):473-9. PubMed ID: 9021265
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Introducing variable gap penalties to sequence alignment in linear space.
    Thompson JD
    Comput Appl Biosci; 1995 Apr; 11(2):181-6. PubMed ID: 7620991
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Local sequence alignments with monotonic gap penalties.
    Mott R
    Bioinformatics; 1999 Jun; 15(6):455-62. PubMed ID: 10383814
    [TBL] [Abstract][Full Text] [Related]  

  • 18. DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment.
    Stoye J; Moulton V; Dress AW
    Comput Appl Biosci; 1997 Dec; 13(6):625-6. PubMed ID: 9475994
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Efficient constrained multiple sequence alignment with performance guarantee.
    Chin FY; Ho NL; Lam TW; Wong PW; Chan MY
    Proc IEEE Comput Soc Bioinform Conf; 2003; 2():337-46. PubMed ID: 16452809
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Hidden Markov models of biological primary sequence information.
    Baldi P; Chauvin Y; Hunkapiller T; McClure MA
    Proc Natl Acad Sci U S A; 1994 Feb; 91(3):1059-63. PubMed ID: 8302831
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.