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 *

104 related articles for article (PubMed ID: 30638400)

  • 1. Computing Nonoverlapping Inversion Distance Between Two Strings in Linear Average Time.
    Wang X; Wang L
    J Comput Biol; 2019 Mar; 26(3):193-201. PubMed ID: 30638400
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Small-World Networks and RNA Secondary Structures.
    Surujon D; Ponty Y; Clote P
    J Comput Biol; 2019 Jan; 26(1):16-26. PubMed ID: 30383444
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A Simple Approach to the Reconstruction of a Set of Points from the Multiset of Pairwise Distances in n
    Fomin E
    J Comput Biol; 2019 Jan; 26(1):68-75. PubMed ID: 30117753
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Prospective, Open Trial of Adjunctive Triple Chronotherapy for the Acute Treatment of Depression in Adolescent Inpatients.
    Hurd D; Herrera M; Brant JM; Coombs NC; Arzubi E
    J Child Adolesc Psychopharmacol; 2019 Feb; 29(1):20-27. PubMed ID: 30388037
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Some Methods for Calculating Competition Coefficients from Resource-Utilization Spectra.
    Schoener TW
    Am Nat; 1974 May - Jun.; 108(961):332-340. PubMed ID: 29513546
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Development and Evaluation of a Telematics Platform for Monitoring of Patients in Ambulatory Major Surgery.
    de Dicastillo EL; García-Zapirain B; Fernández MTA; de la Torre Díez I; Oleagordia I; Celaya AA
    Telemed J E Health; 2019 Feb; 25(2):152-159. PubMed ID: 30256743
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Genetic Variants in the
    Matana A; Popović M; Boutin T; Torlak V; Brdar D; Gunjača I; Kolčić I; Boraska Perica V; Punda A; Rudan I; Polašek O; Barbalić M; Hayward C; Zemunik T
    Thyroid; 2019 Jun; 29(6):886-893. PubMed ID: 30929638
    [No Abstract]   [Full Text] [Related]  

  • 8. A Simple Linear Space Algorithm for Computing Nonoverlapping Inversion and Transposition Distance in Quadratic Average Time.
    Wang X; Wang L
    J Comput Biol; 2018 Jun; 25(6):563-575. PubMed ID: 29658774
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Scale-up of nanoemulsion produced by emulsification and solvent diffusion.
    Mitri K; Vauthier C; Huang N; Menas A; Ringard-Lefebvre C; Anselmi C; Stambouli M; Rosilio V; Vachon JJ; Bouchemal K
    J Pharm Sci; 2012 Nov; 101(11):4240-7. PubMed ID: 22886515
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Maximal oxygen consumption of Colombian women of differing socioeconomic status.
    Spurr GB; Reina JC; Narvaez JV; Dufour DL
    Am J Hum Biol; 1992; 4(5):625-633. PubMed ID: 28524587
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Sorting signed permutations by inversions in O(nlogn) time.
    Swenson KM; Rajan V; Lin Y; Moret BM
    J Comput Biol; 2010 Mar; 17(3):489-501. PubMed ID: 20377459
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Linear space string correction algorithm using the Damerau-Levenshtein distance.
    Zhao C; Sahni S
    BMC Bioinformatics; 2020 Dec; 21(Suppl 1):4. PubMed ID: 33297940
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Improved algorithms for approximate string matching (extended abstract).
    Papamichail D; Papamichail G
    BMC Bioinformatics; 2009 Jan; 10 Suppl 1(Suppl 1):S10. PubMed ID: 19208109
    [TBL] [Abstract][Full Text] [Related]  

  • 14. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study.
    Bader DA; Moret BM; Yan M
    J Comput Biol; 2001; 8(5):483-91. PubMed ID: 11694179
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Morphometric diffusing capacity and functional anatomy of the book lungs in the spider Tegenaria spp. (Agelenidae).
    Strazny F; Perry SF
    J Morphol; 1984 Dec; 182(3):339-354. PubMed ID: 30029565
    [TBL] [Abstract][Full Text] [Related]  

  • 16. A fast algorithm for the optimal alignment of three strings.
    Allison L
    J Theor Biol; 1993 Sep; 164(2):261-9. PubMed ID: 8246519
    [TBL] [Abstract][Full Text] [Related]  

  • 17. On the hardness of counting and sampling center strings.
    Boucher C; Omar M
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(6):1843-6. PubMed ID: 22641713
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Multiple sequence alignment with arbitrary gap costs: computing an optimal solution using polyhedral combinatorics.
    Althaus E; Caprara A; Lenhof HP; Reinert K
    Bioinformatics; 2002; 18 Suppl 2():S4-S16. PubMed ID: 12385977
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Efficient constrained multiple sequence alignment with performance guarantee.
    Chin FY; Ho NL; Lam TW; Wong PW
    J Bioinform Comput Biol; 2005 Feb; 3(1):1-18. PubMed ID: 15751109
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Efficient constrained multiple sequence alignment with performance guarantee.
    Chin FY; Ho NL; Lam TW; Wong PW; Chan MY
    Proc IEEE Comput Soc Bioinform Conf; 2003; 2():337-46. PubMed ID: 16452809
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.