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 *

120 related articles for article (PubMed ID: 21172054)

  • 1. Integer programming-based method for grammar-based tree compression and its application to pattern extraction of glycan tree structures.
    Zhao Y; Hayashida M; Akutsu T
    BMC Bioinformatics; 2010 Dec; 11 Suppl 11(Suppl 11):S4. PubMed ID: 21172054
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Grammar-based compression approach to extraction of common rules among multiple trees of glycans and RNAs.
    Zhao Y; Hayashida M; Cao Y; Hwang J; Akutsu T
    BMC Bioinformatics; 2015 Apr; 16():128. PubMed ID: 25907438
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures.
    Fukagawa D; Tamura T; Takasu A; Tomita E; Akutsu T
    BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S13. PubMed ID: 21342542
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A dynamic programming algorithm to predict synthesis processes of tree-structured compounds with graph grammar.
    Zhao Y; Tamura T; Hayashida M; Akutsu T
    Genome Inform; 2010; 24():218-29. PubMed ID: 22081602
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A clique-based method using dynamic programming for computing edit distance between unordered trees.
    Mori T; Tamura T; Fukagawa D; Takasu A; Tomita E; Akutsu T
    J Comput Biol; 2012 Oct; 19(10):1089-104. PubMed ID: 23057820
    [TBL] [Abstract][Full Text] [Related]  

  • 6. A Gibbs sampling approach to detection of tree motifs.
    Meireles LM; Akutsu T
    Genome Inform; 2005; 16(1):34-43. PubMed ID: 16362904
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Algorithmic height compression of unordered trees.
    Ben-Naoum F; Godin C
    J Theor Biol; 2016 Jan; 389():237-52. PubMed ID: 26551155
    [TBL] [Abstract][Full Text] [Related]  

  • 8. The context-tree kernel for strings.
    Cuturi M; Vert JP
    Neural Netw; 2005 Oct; 18(8):1111-23. PubMed ID: 16198086
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Pair stochastic tree adjoining grammars for aligning and predicting pseudoknot RNA structures.
    Matsui H; Sato K; Sakakibara Y
    Proc IEEE Comput Syst Bioinform Conf; 2004; ():290-9. PubMed ID: 16448022
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Algorithms for Regular Tree Grammar Network Search and Their Application to Mining Human-viral Infection Patterns.
    Smoly I; Carmel A; Shemer-Avni Y; Yeger-Lotem E; Ziv-Ukelson M
    J Comput Biol; 2016 Mar; 23(3):165-79. PubMed ID: 26953875
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Designing an A* algorithm for calculating edit distance between rooted-unordered trees.
    Horesh Y; Mehr R; Unger R
    J Comput Biol; 2006; 13(6):1165-76. PubMed ID: 16901235
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Pair stochastic tree adjoining grammars for aligning and predicting pseudoknot RNA structures.
    Matsui H; Sato K; Sakakibara Y
    Bioinformatics; 2005 Jun; 21(11):2611-7. PubMed ID: 15784748
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing.
    Kempa D; Langmead B
    Lebniz Int Proc Inform; 2021; 204():. PubMed ID: 37906626
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A stochastic context free grammar based framework for analysis of protein sequences.
    Dyrka W; Nebel JC
    BMC Bioinformatics; 2009 Oct; 10():323. PubMed ID: 19814800
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming.
    Lyubetsky V; Gershgorin R; Gorbunov K
    BMC Bioinformatics; 2017 Dec; 18(1):537. PubMed ID: 29212445
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Seeded tree alignment.
    Lozano A; Pinter RY; Rokhlenko O; Valiente G; Ziv-Ukelson M
    IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(4):503-13. PubMed ID: 18989038
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Multithreaded parsing for predicting RNA secondary structures.
    Al-Mulhem MS
    Int J Bioinform Res Appl; 2010; 6(6):609-21. PubMed ID: 21354966
    [TBL] [Abstract][Full Text] [Related]  

  • 18. imPhy: Imputing Phylogenetic Trees with Missing Information Using Mathematical Programming.
    Yasui N; Vogiatzis C; Yoshida R; Fukumizu K
    IEEE/ACM Trans Comput Biol Bioinform; 2020; 17(4):1222-1230. PubMed ID: 30507538
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem.
    Zörnig P
    J Comput Biol; 2015 Aug; 22(8):729-42. PubMed ID: 25525691
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Determination of glycan structure from tandem mass spectra.
    Böcker S; Kehr B; Rasche F
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):976-86. PubMed ID: 21173459
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.