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 *

145 related articles for article (PubMed ID: 24989859)

  • 21. PSSM-based prediction of DNA binding sites in proteins.
    Ahmad S; Sarai A
    BMC Bioinformatics; 2005 Feb; 6():33. PubMed ID: 15720719
    [TBL] [Abstract][Full Text] [Related]  

  • 22. The generalised k-Truncated Suffix Tree for time-and space-efficient searches in multiple DNA or protein sequences.
    Schulz MH; Bauer S; Robinson PN
    Int J Bioinform Res Appl; 2008; 4(1):81-95. PubMed ID: 18283030
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Sequence Alignment on Directed Graphs.
    Kavya VNS; Tayal K; Srinivasan R; Sivadasan N
    J Comput Biol; 2019 Jan; 26(1):53-67. PubMed ID: 30204489
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Using progressive methods for global multiple sequence alignment.
    Mount DW
    Cold Spring Harb Protoc; 2009 Jul; 2009(7):pdb.top43. PubMed ID: 20147224
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Pseudo-periodic partitions of biological sequences.
    Li L; Jin R; Kok PL; Wan H
    Bioinformatics; 2004 Feb; 20(3):295-306. PubMed ID: 14960455
    [TBL] [Abstract][Full Text] [Related]  

  • 26. A greedy, graph-based algorithm for the alignment of multiple homologous gene lists.
    Fostier J; Proost S; Dhoedt B; Saeys Y; Demeester P; Van de Peer Y; Vandepoele K
    Bioinformatics; 2011 Mar; 27(6):749-56. PubMed ID: 21216775
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Location of repetitive regions in sequences by optimizing a compression method.
    Delgrange O; Dauchet M; Rivals E
    Pac Symp Biocomput; 1999; ():254-65. PubMed ID: 10380202
    [TBL] [Abstract][Full Text] [Related]  

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

  • 29. Using Multiple Fickett Bands to Accelerate Biological Sequence Comparisons.
    Silva GHG; Sandes EFO; Teodoro G; Melo ACMA
    J Comput Biol; 2019 Sep; 26(9):908-922. PubMed ID: 30951368
    [No Abstract]   [Full Text] [Related]  

  • 30. A local algorithm for DNA sequence alignment with inversions.
    Schöniger M; Waterman MS
    Bull Math Biol; 1992 Jul; 54(4):521-36. PubMed ID: 1591531
    [TBL] [Abstract][Full Text] [Related]  

  • 31. A uniform projection method for motif discovery in DNA sequences.
    Raphael B; Liu LT; Varghese G
    IEEE/ACM Trans Comput Biol Bioinform; 2004; 1(2):91-4. PubMed ID: 17048384
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Searching maximal degenerate motifs guided by a compact suffix tree.
    Jiang H; Zhao Y; Chen W; Zheng W
    Adv Exp Med Biol; 2010; 680():19-26. PubMed ID: 20865482
    [TBL] [Abstract][Full Text] [Related]  

  • 33. A short note on dynamic programming in a band.
    Gibrat JF
    BMC Bioinformatics; 2018 Jun; 19(1):226. PubMed ID: 29902968
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Alignment of biological sequences with quality scores.
    Na JC; Roh K; Apostolico A; Park K
    Int J Bioinform Res Appl; 2009; 5(1):97-113. PubMed ID: 19136367
    [TBL] [Abstract][Full Text] [Related]  

  • 35. NemaFootPrinter: a web based software for the identification of conserved non-coding genome sequence regions between C. elegans and C. briggsae.
    Rambaldi D; Guffanti A; Morandi P; Cassata G
    BMC Bioinformatics; 2005 Dec; 6 Suppl 4(Suppl 4):S22. PubMed ID: 16351749
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Minimal entropy probability paths between genome families.
    Ahlbrandt C; Benson G; Casey W
    J Math Biol; 2004 May; 48(5):563-90. PubMed ID: 15133624
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Design optimization methods for genomic DNA tiling arrays.
    Bertone P; Trifonov V; Rozowsky JS; Schubert F; Emanuelsson O; Karro J; Kao MY; Snyder M; Gerstein M
    Genome Res; 2006 Feb; 16(2):271-81. PubMed ID: 16365382
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Pairwise alignment for very long nucleic acid sequences.
    Sun J; Chen K; Hao Z
    Biochem Biophys Res Commun; 2018 Jul; 502(3):313-317. PubMed ID: 29800571
    [TBL] [Abstract][Full Text] [Related]  

  • 39. An efficient alignment algorithm for searching simple pseudoknots over long genomic sequence.
    Ma C; Wong TK; Lam TW; Hon WK; Sadakane K; Yiu SM
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(6):1629-38. PubMed ID: 22848134
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Accurate anchoring alignment of divergent sequences.
    Huang W; Umbach DM; Li L
    Bioinformatics; 2006 Jan; 22(1):29-34. PubMed ID: 16301203
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 8.