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 *

161 related articles for article (PubMed ID: 32940748)

  • 1. Structure of the space of taboo-free sequences.
    Manuel C; von Haeseler A
    J Math Biol; 2020 Nov; 81(4-5):1029-1057. PubMed ID: 32940748
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Encoded expansion: an efficient algorithm to discover identical string motifs.
    Azmi AM; Al-Ssulami A
    PLoS One; 2014; 9(5):e95148. PubMed ID: 24871320
    [TBL] [Abstract][Full Text] [Related]  

  • 3. On the characterization of claw-free graphs with given total restrained domination number.
    Pi X
    Springerplus; 2016; 5(1):1753. PubMed ID: 27795896
    [TBL] [Abstract][Full Text] [Related]  

  • 4. ET-Motif: Solving the Exact (l, d)-Planted Motif Problem Using Error Tree Structure.
    Al-Okaily A; Huang CH
    J Comput Biol; 2016 Jul; 23(7):615-23. PubMed ID: 27152692
    [TBL] [Abstract][Full Text] [Related]  

  • 5. A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.
    Dinh H; Rajasekaran S
    Bioinformatics; 2011 Jul; 27(14):1901-7. PubMed ID: 21636593
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Linear-time computation of minimal absent words using suffix array.
    Barton C; Heliou A; Mouchard L; Pissis SP
    BMC Bioinformatics; 2014 Dec; 15(1):388. PubMed ID: 25526884
    [TBL] [Abstract][Full Text] [Related]  

  • 7. NetMODE: network motif detection without Nauty.
    Li X; Stones DS; Wang H; Deng H; Liu X; Wang G
    PLoS One; 2012; 7(12):e50093. PubMed ID: 23272055
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Spectral properties of a class of unicyclic graphs.
    Du Z
    J Inequal Appl; 2017; 2017(1):96. PubMed ID: 28529433
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Isometric Hamming embeddings of weighted graphs.
    Berleant J; Sheridan K; Condon A; Williams VV; Bathe M
    Discrete Appl Math; 2023 Jun; 332():119-128. PubMed ID: 37982050
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Error Tree: A Tree Structure for Hamming and Edit Distances and Wildcards Matching.
    Al-Okaily A
    J Comput Biol; 2015 Dec; 22(12):1118-28. PubMed ID: 26402070
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Accessibility percolation on Cartesian power graphs.
    Schmiegelt B; Krug J
    J Math Biol; 2023 Feb; 86(3):46. PubMed ID: 36790641
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Bounds for the general sum-connectivity index of composite graphs.
    Akhter S; Imran M; Raza Z
    J Inequal Appl; 2017; 2017(1):76. PubMed ID: 28469353
    [TBL] [Abstract][Full Text] [Related]  

  • 13. An Efficient Dual Sampling Algorithm with Hamming Distance Filtration.
    Barrett C; He Q; Huang FW; Reidys CM
    J Comput Biol; 2018 Nov; 25(11):1179-1192. PubMed ID: 30133328
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph.
    Jia H; Song H
    J Inequal Appl; 2018; 2018(1):69. PubMed ID: 29628745
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Quantum tunneling and quantum walks as algorithmic resources to solve hard K-SAT instances.
    Campos E; Venegas-Andraca SE; Lanzagorta M
    Sci Rep; 2021 Aug; 11(1):16845. PubMed ID: 34413348
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Bounds for phylogenetic network space metrics.
    Francis A; Huber KT; Moulton V; Wu T
    J Math Biol; 2018 Apr; 76(5):1229-1248. PubMed ID: 28836230
    [TBL] [Abstract][Full Text] [Related]  

  • 17. libFLASM: a software library for fixed-length approximate string matching.
    Ayad LA; Pissis SP; Retha A
    BMC Bioinformatics; 2016 Nov; 17(1):454. PubMed ID: 27832739
    [TBL] [Abstract][Full Text] [Related]  

  • 18. On avoided words, absent words, and their application to biological sequence analysis.
    Almirantis Y; Charalampopoulos P; Gao J; Iliopoulos CS; Mohamed M; Pissis SP; Polychronopoulos D
    Algorithms Mol Biol; 2017; 12():5. PubMed ID: 28293277
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Context-free pairs of groups I: Context-free pairs and graphs.
    Ceccherini-Silberstein T; Woess W
    Eur J Comb; 2012 Oct; 33(7):1449-1466. PubMed ID: 27087724
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An Algorithm to detect balancing of iterated line sigraph.
    Sinha D; Sethi A
    Springerplus; 2015; 4(1):704. PubMed ID: 28516030
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.