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 *

95 related articles for article (PubMed ID: 26120359)

  • 1. A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs.
    Sacomoto G; Lacroix V; Sagot MF
    Algorithms Mol Biol; 2015; 10():20. PubMed ID: 26120359
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads.
    Lima L; Sinaimeri B; Sacomoto G; Lopez-Maestre H; Marchet C; Miele V; Sagot MF; Lacroix V
    Algorithms Mol Biol; 2017; 12():2. PubMed ID: 28250805
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Enumerating treelike chemical graphs with given path frequency.
    Fujiwara H; Wang J; Zhao L; Nagamochi H; Akutsu T
    J Chem Inf Model; 2008 Jul; 48(7):1345-57. PubMed ID: 18588284
    [TBL] [Abstract][Full Text] [Related]  

  • 4. AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS.
    Kundeti V; Rajasekaran S; Dinh H
    Discrete Math Algorithms Appl; 2010; 1():184-196. PubMed ID: 25364472
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Read-Split-Run: an improved bioinformatics pipeline for identification of genome-wide non-canonical spliced regions using RNA-Seq data.
    Bai Y; Kinne J; Donham B; Jiang F; Ding L; Hassler JR; Kaufman RJ
    BMC Genomics; 2016 Aug; 17 Suppl 7(Suppl 7):503. PubMed ID: 27556805
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Heuristic pairwise alignment of de Bruijn graphs to facilitate simultaneous transcript discovery in related organisms from RNA-Seq data.
    Fu S; Tarone AM; Sze SH
    BMC Genomics; 2015; 16 Suppl 11(Suppl 11):S5. PubMed ID: 26576690
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Efficient enumeration of monocyclic chemical graphs with given path frequencies.
    Suzuki M; Nagamochi H; Akutsu T
    J Cheminform; 2014; 6():31. PubMed ID: 24955135
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Identifying similar transcripts in a related organism from de Bruijn graphs of RNA-Seq data, with applications to the study of salt and waterlogging tolerance in Melilotus.
    Fu S; Chang PL; Friesen ML; Teakle NL; Tarone AM; Sze SH
    BMC Genomics; 2019 Jun; 20(Suppl 5):425. PubMed ID: 31167652
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A linear delay algorithm for enumerating all connected induced subgraphs.
    Alokshiya M; Salem S; Abed F
    BMC Bioinformatics; 2019 Jun; 20(Suppl 12):319. PubMed ID: 31216984
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies.
    Shimizu M; Nagamochi H; Akutsu T
    BMC Bioinformatics; 2011 Dec; 12 Suppl 14(Suppl 14):S3. PubMed ID: 22373441
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Studying Isoform-Specific mRNA Recruitment to Polyribosomes with Frac-seq.
    Martinez-Nunez RT; Sanford JR
    Methods Mol Biol; 2016; 1358():99-108. PubMed ID: 26463379
    [TBL] [Abstract][Full Text] [Related]  

  • 12. On Finding and Enumerating Maximal and Maximum
    Phillips CA; Wang K; Baker EJ; Bubier JA; Chesler EJ; Langston MA
    Algorithms; 2019 Jan; 12(1):. PubMed ID: 31448059
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Superbubbles revisited.
    Gärtner F; Müller L; Stadler PF
    Algorithms Mol Biol; 2018; 13():16. PubMed ID: 30519278
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
    Nishiyama Y; Shurbevski A; Nagamochi H; Akutsu T
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):77-90. PubMed ID: 29994050
    [TBL] [Abstract][Full Text] [Related]  

  • 15. MegaGTA: a sensitive and accurate metagenomic gene-targeted assembler using iterative de Bruijn graphs.
    Li D; Huang Y; Leung CM; Luo R; Ting HF; Lam TW
    BMC Bioinformatics; 2017 Oct; 18(Suppl 12):408. PubMed ID: 29072142
    [TBL] [Abstract][Full Text] [Related]  

  • 16. EUCALYPT: efficient tree reconciliation enumerator.
    Donati B; Baudet C; Sinaimeri B; Crescenzi P; Sagot MF
    Algorithms Mol Biol; 2015; 10(1):3. PubMed ID: 25648467
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Colored de Bruijn graphs and the genome halving problem.
    Alekseyev MA; Pevzner PA
    IEEE/ACM Trans Comput Biol Bioinform; 2007; 4(1):98-107. PubMed ID: 17277417
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Branch-and-bound algorithms for enumerating treelike chemical graphs with given path frequency using detachment-cut.
    Ishida Y; Kato Y; Zhao L; Nagamochi H; Akutsu T
    J Chem Inf Model; 2010 May; 50(5):934-46. PubMed ID: 20415496
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Comparison of RNA-seq and microarray platforms for splice event detection using a cross-platform algorithm.
    Romero JP; Ortiz-Estévez M; Muniategui A; Carrancio S; de Miguel FJ; Carazo F; Montuenga LM; Loos R; Pío R; Trotter MWB; Rubio A
    BMC Genomics; 2018 Sep; 19(1):703. PubMed ID: 30253752
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Faster Cut Sparsification of Weighted Graphs.
    Forster S; de Vos T
    Algorithmica; 2023; 85(4):929-964. PubMed ID: 37008076
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.