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 *

85 related articles for article (PubMed ID: 26120359)

  • 21. Identifying splicing regulatory elements with de Bruijn graphs.
    Badr E; Heath LS
    J Comput Biol; 2014 Dec; 21(12):880-97. PubMed ID: 25393830
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Complete alternative splicing events are bubbles in splicing graphs.
    Sammeth M
    J Comput Biol; 2009 Aug; 16(8):1117-40. PubMed ID: 19689216
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Polynomial iterative algorithms for coloring and analyzing random graphs.
    Braunstein A; Mulet R; Pagnani A; Weigt M; Zecchina R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Sep; 68(3 Pt 2):036702. PubMed ID: 14524921
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Enumerating consistent sub-graphs of directed acyclic graphs: an insight into biomedical ontologies.
    Peng Y; Jiang Y; Radivojac P
    Bioinformatics; 2018 Jul; 34(13):i313-i322. PubMed ID: 29949985
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Improved algorithms for enumerating tree-like chemical graphs with given path frequency.
    Ishida Y; Zhao L; Nagamochi H; Akutsu T
    Genome Inform; 2008; 21():53-64. PubMed ID: 19425147
    [TBL] [Abstract][Full Text] [Related]  

  • 26. DTA-SiST: de novo transcriptome assembly by using simplified suffix trees.
    Zhao J; Feng H; Zhu D; Zhang C; Xu Y
    BMC Bioinformatics; 2019 Dec; 20(Suppl 25):698. PubMed ID: 31874618
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Bit-parallel sequence-to-graph alignment.
    Rautiainen M; Mäkinen V; Marschall T
    Bioinformatics; 2019 Oct; 35(19):3599-3607. PubMed ID: 30851095
    [TBL] [Abstract][Full Text] [Related]  

  • 28. An extended dual graph library and partitioning algorithm applicable to pseudoknotted RNA structures.
    Jain S; Saju S; Petingi L; Schlick T
    Methods; 2019 Jun; 162-163():74-84. PubMed ID: 30928508
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Compacting de Bruijn graphs from sequencing data quickly and in low memory.
    Chikhi R; Limasset A; Medvedev P
    Bioinformatics; 2016 Jun; 32(12):i201-i208. PubMed ID: 27307618
    [TBL] [Abstract][Full Text] [Related]  

  • 30. A general framework for genome rearrangement with biological constraints.
    Simonaitis P; Chateau A; Swenson KM
    Algorithms Mol Biol; 2019; 14():15. PubMed ID: 31360217
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Computing a maximum clique in geometric superclasses of disk graphs.
    Grelier N
    J Comb Optim; 2022; 44(4):3106-3135. PubMed ID: 36258784
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Benchmarking of de novo assembly algorithms for Nanopore data reveals optimal performance of OLC approaches.
    Cherukuri Y; Janga SC
    BMC Genomics; 2016 Aug; 17 Suppl 7(Suppl 7):507. PubMed ID: 27556636
    [TBL] [Abstract][Full Text] [Related]  

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

  • 34. TransComb: genome-guided transcriptome assembly via combing junctions in splicing graphs.
    Liu J; Yu T; Jiang T; Li G
    Genome Biol; 2016 Oct; 17(1):213. PubMed ID: 27760567
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Nature reserve selection problem: a tight approximation algorithm.
    Bordewich M; Semple C
    IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(2):275-80. PubMed ID: 18451436
    [TBL] [Abstract][Full Text] [Related]  

  • 36. The signature molecular descriptor. 4. Canonizing molecules using extended valence sequences.
    Faulon JL; Collins MJ; Carr RD
    J Chem Inf Comput Sci; 2004; 44(2):427-36. PubMed ID: 15032522
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs.
    Li J; Nagamochi H; Akutsu T
    IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):633-646. PubMed ID: 28113952
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Identification of genome-wide non-canonical spliced regions and analysis of biological functions for spliced sequences using Read-Split-Fly.
    Bai Y; Kinne J; Ding L; Rath EC; Cox A; Naidu SD
    BMC Bioinformatics; 2017 Oct; 18(Suppl 11):382. PubMed ID: 28984182
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Models and algorithms for genome rearrangement with positional constraints.
    Swenson KM; Simonaitis P; Blanchette M
    Algorithms Mol Biol; 2016; 11():13. PubMed ID: 27190550
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Assembly of long error-prone reads using de Bruijn graphs.
    Lin Y; Yuan J; Kolmogorov M; Shen MW; Chaisson M; Pevzner PA
    Proc Natl Acad Sci U S A; 2016 Dec; 113(52):E8396-E8405. PubMed ID: 27956617
    [TBL] [Abstract][Full Text] [Related]  

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