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 *

156 related articles for article (PubMed ID: 24168705)

  • 1. Efficient edit distance with duplications and contractions.
    Pinhas T; Zakov S; Tsur D; Ziv-Ukelson M
    Algorithms Mol Biol; 2013 Oct; 8(1):27. PubMed ID: 24168705
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. Fast exact algorithms for the closest string and substring problems with application to the planted (L, d)-motif model.
    Chen ZZ; Wang L
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1400-10. PubMed ID: 21282867
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. String correction using the Damerau-Levenshtein distance.
    Zhao C; Sahni S
    BMC Bioinformatics; 2019 Jun; 20(Suppl 11):277. PubMed ID: 31167641
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 8. Efficient sequential and parallel algorithms for finding edit distance based motifs.
    Pal S; Xiao P; Rajasekaran S
    BMC Genomics; 2016 Aug; 17 Suppl 4(Suppl 4):465. PubMed ID: 27557423
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Short superstrings and the structure of overlapping strings.
    Armen C; Stein C
    J Comput Biol; 1995; 2(2):307-32. PubMed ID: 7497131
    [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. A combinatorial approach to the design of vaccines.
    Martínez L; Milanič M; Legarreta L; Medvedev P; Malaina I; de la Fuente IM
    J Math Biol; 2015 May; 70(6):1327-58. PubMed ID: 24859149
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Computing Generalized Convolutions Faster Than Brute Force.
    Esmer BC; Kulik A; Marx D; Schepper P; Węgrzycki K
    Algorithmica; 2024; 86(1):334-366. PubMed ID: 38188497
    [TBL] [Abstract][Full Text] [Related]  

  • 13. A new efficient algorithm for the gene-team problem on general sequences.
    Wang BF; Kuo CC; Liu SJ; Lin CH
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(2):330-44. PubMed ID: 22282907
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Parallel Parsing Algorithms and VLSI Implementations for Syntactic Pattern Recognition.
    Chiang YT; Fu KS
    IEEE Trans Pattern Anal Mach Intell; 1984 Mar; 6(3):302-14. PubMed ID: 21869196
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Closest string with outliers.
    Boucher C; Ma B
    BMC Bioinformatics; 2011 Feb; 12 Suppl 1(Suppl 1):S55. PubMed ID: 21342588
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
    Kundeti VK; Rajasekaran S; Dinh H; Vaughn M; Thapar V
    BMC Bioinformatics; 2010 Nov; 11():560. PubMed ID: 21078174
    [TBL] [Abstract][Full Text] [Related]  

  • 17. An efficient algorithm for finding short approximate non-tandem repeats.
    Adebiyi EF; Jiang T; Kaufmann M
    Bioinformatics; 2001; 17 Suppl 1():S5-S12. PubMed ID: 11472987
    [TBL] [Abstract][Full Text] [Related]  

  • 18. An approximate matching algorithm for finding (sub-)optimal sequences in S-attributed grammars.
    Waldispühl J; Behzadi B; Steyaert JM
    Bioinformatics; 2002; 18 Suppl 2():S250-9. PubMed ID: 12386010
    [TBL] [Abstract][Full Text] [Related]  

  • 19. A faster algorithm for simultaneous alignment and folding of RNA.
    Ziv-Ukelson M; Gat-Viks I; Wexler Y; Shamir R
    J Comput Biol; 2010 Aug; 17(8):1051-65. PubMed ID: 20649420
    [TBL] [Abstract][Full Text] [Related]  

  • 20. New Tools and Connections for Exponential-Time Approximation.
    Bansal N; Chalermsook P; Laekhanukit B; Nanongkai D; Nederlof J
    Algorithmica; 2019; 81(10):3993-4009. PubMed ID: 31496549
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.