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 *

152 related articles for article (PubMed ID: 23590940)

  • 1. Unrooted unordered homeomorphic subtree alignment of RNA trees.
    Milo N; Zakov S; Katzenelson E; Bachmat E; Dinitz Y; Ziv-Ukelson M
    Algorithms Mol Biol; 2013 Apr; 8(1):13. PubMed ID: 23590940
    [TBL] [Abstract][Full Text] [Related]  

  • 2. An optimal algorithm for computing all subtree repeats in trees.
    Flouri T; Kobert K; Pissis SP; Stamatakis A
    Philos Trans A Math Phys Eng Sci; 2014 May; 372(2016):20130140. PubMed ID: 24751873
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. Transforming rooted agreement into unrooted agreement.
    Przytycka TM
    J Comput Biol; 1998; 5(2):335-49. PubMed ID: 9672836
    [TBL] [Abstract][Full Text] [Related]  

  • 5. SPR distance computation for unrooted trees.
    Hickey G; Dehne F; Rau-Chaplin A; Blouin C
    Evol Bioinform Online; 2008 Feb; 4():17-27. PubMed ID: 19204804
    [TBL] [Abstract][Full Text] [Related]  

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

  • 7. On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems.
    van Iersel L; Kelk S; Stamoulis G; Stougie L; Boes O
    Algorithmica; 2018; 80(11):2993-3022. PubMed ID: 30956378
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Improved parameterized complexity of the maximum agreement subtree and maximum compatible tree problems.
    Berry V; Nicolas F
    IEEE/ACM Trans Comput Biol Bioinform; 2006; 3(3):289-302. PubMed ID: 17048466
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Parametric alignment of ordered trees.
    Wang L; Zhao J
    Bioinformatics; 2003 Nov; 19(17):2237-45. PubMed ID: 14630652
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Two metrics on rooted unordered trees with labels.
    Wang Y
    Algorithms Mol Biol; 2022 Jun; 17(1):13. PubMed ID: 35668521
    [TBL] [Abstract][Full Text] [Related]  

  • 11. New techniques for mining frequent patterns in unordered trees.
    Zhang S; Du Z; Wang JT
    IEEE Trans Cybern; 2015 Jun; 45(6):1113-25. PubMed ID: 25137740
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A structure-based flexible search method for motifs in RNA.
    Veksler-Lublinsky I; Ziv-Ukelson M; Barash D; Kedem K
    J Comput Biol; 2007 Sep; 14(7):908-26. PubMed ID: 17803370
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Efficient FPT Algorithms for (Strict) Compatibility of Unrooted Phylogenetic Trees.
    Baste J; Paul C; Sau I; Scornavacca C
    Bull Math Biol; 2017 Apr; 79(4):920-938. PubMed ID: 28247121
    [TBL] [Abstract][Full Text] [Related]  

  • 14. On cherry and pitchfork distributions of random rooted and unrooted phylogenetic trees.
    Choi KP; Thompson A; Wu T
    Theor Popul Biol; 2020 Apr; 132():92-104. PubMed ID: 32135170
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Fast Dating Using Least-Squares Criteria and Algorithms.
    To TH; Jung M; Lycett S; Gascuel O
    Syst Biol; 2016 Jan; 65(1):82-97. PubMed ID: 26424727
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees.
    Sand A; Brodal GS; Fagerberg R; Pedersen CN; Mailund T
    BMC Bioinformatics; 2013; 14 Suppl 2(Suppl 2):S18. PubMed ID: 23368759
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Web-Beagle: a web server for the alignment of RNA secondary structures.
    Mattei E; Pietrosanto M; Ferrè F; Helmer-Citterich M
    Nucleic Acids Res; 2015 Jul; 43(W1):W493-7. PubMed ID: 25977293
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Inferring optimal species trees under gene duplication and loss.
    Bayzid MS; Mirarab S; Warnow T
    Pac Symp Biocomput; 2013; ():250-61. PubMed ID: 23424130
    [TBL] [Abstract][Full Text] [Related]  

  • 19. constNJ: an algorithm to reconstruct sets of phylogenetic trees satisfying pairwise topological constraints.
    Matsen FA
    J Comput Biol; 2010 Jun; 17(6):799-818. PubMed ID: 20500096
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A polynomial-time algorithm computing lower and upper bounds of the rooted subtree prune and regraft distance.
    Kannan L; Li H; Mushegian A
    J Comput Biol; 2011 May; 18(5):743-57. PubMed ID: 21166560
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.