BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

123 related articles for article (PubMed ID: 8246519)

  • 1. A fast algorithm for the optimal alignment of three strings.
    Allison L
    J Theor Biol; 1993 Sep; 164(2):261-9. PubMed ID: 8246519
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Fast, optimal alignment of three sequences using linear gap costs.
    Powell DR; Allison L; Dix TI
    J Theor Biol; 2000 Dec; 207(3):325-36. PubMed ID: 11082303
    [TBL] [Abstract][Full Text] [Related]  

  • 3. 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]  

  • 4. Fast exact algorithms for the closest string and substring problems with application to the planted (L, d)-motif model.
    Chen ZZ; Wang L
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1400-10. PubMed ID: 21282867
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A fast parallel algorithm for finding the longest common sequence of multiple biosequences.
    Chen Y; Wan A; Liu W
    BMC Bioinformatics; 2006 Dec; 7 Suppl 4(Suppl 4):S4. PubMed ID: 17217522
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Optimally separating sequences.
    Myers G
    Genome Inform; 2001; 12():165-74. PubMed ID: 11791235
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Improved algorithms for approximate string matching (extended abstract).
    Papamichail D; Papamichail G
    BMC Bioinformatics; 2009 Jan; 10 Suppl 1(Suppl 1):S10. PubMed ID: 19208109
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Protein fold comparison by the alignment of topological strings.
    Johannissen LO; Taylor WR
    Protein Eng; 2003 Dec; 16(12):949-55. PubMed ID: 14983074
    [TBL] [Abstract][Full Text] [Related]  

  • 9. An adaptive and iterative algorithm for refining multiple sequence alignment.
    Wang Y; Li KB
    Comput Biol Chem; 2004 Apr; 28(2):141-8. PubMed ID: 15130542
    [TBL] [Abstract][Full Text] [Related]  

  • 10. CAALIGN: a program for pairwise and multiple protein-structure alignment.
    Oldfield TJ
    Acta Crystallogr D Biol Crystallogr; 2007 Apr; 63(Pt 4):514-25. PubMed ID: 17372357
    [TBL] [Abstract][Full Text] [Related]  

  • 11. MSAID: multiple sequence alignment based on a measure of information discrepancy.
    Zhang M; Fang W; Zhang J; Chi Z
    Comput Biol Chem; 2005 Apr; 29(2):175-81. PubMed ID: 15833445
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Regular language constrained sequence alignment revisited.
    Kucherov G; Pinhas T; Ziv-Ukelson M
    J Comput Biol; 2011 May; 18(5):771-81. PubMed ID: 21554020
    [TBL] [Abstract][Full Text] [Related]  

  • 13. An iterative refinement algorithm for consistency based multiple structural alignment methods.
    Chen Y; Crippen GM
    Bioinformatics; 2006 Sep; 22(17):2087-93. PubMed ID: 16809393
    [TBL] [Abstract][Full Text] [Related]  

  • 14. PartTree: an algorithm to build an approximate tree from a large number of unaligned sequences.
    Katoh K; Toh H
    Bioinformatics; 2007 Feb; 23(3):372-4. PubMed ID: 17118958
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Constructing near-perfect phylogenies with multiple homoplasy events.
    Satya RV; Mukherjee A; Alexe G; Parida L; Bhanot G
    Bioinformatics; 2006 Jul; 22(14):e514-22. PubMed ID: 16873515
    [TBL] [Abstract][Full Text] [Related]  

  • 16. On the quality of tree-based protein classification.
    Lazareva-Ulitsky B; Diemer K; Thomas PD
    Bioinformatics; 2005 May; 21(9):1876-90. PubMed ID: 15647305
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Significant improvement in accuracy of multiple protein sequence alignments by iterative refinement as assessed by reference to structural alignments.
    Gotoh O
    J Mol Biol; 1996 Dec; 264(4):823-38. PubMed ID: 8980688
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Towards a better solution to the shortest common supersequence problem: the deposition and reduction algorithm.
    Ning K; Leong HW
    BMC Bioinformatics; 2006 Dec; 7 Suppl 4(Suppl 4):S12. PubMed ID: 17217504
    [TBL] [Abstract][Full Text] [Related]  

  • 19. An improved algorithm for statistical alignment of sequences related by a star tree.
    Miklós I
    Bull Math Biol; 2002 Jul; 64(4):771-9. PubMed ID: 12216420
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Deposition and extension approach to find longest common subsequence for thousands of long sequences.
    Ning K
    Comput Biol Chem; 2010 Jun; 34(3):149-57. PubMed ID: 20570215
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.