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 *

98 related articles for article (PubMed ID: 1468013)

  • 21. A computational method for resequencing long DNA targets by universal oligonucleotide arrays.
    Pe'er I; Arbili N; Shamir R
    Proc Natl Acad Sci U S A; 2002 Nov; 99(24):15492-6. PubMed ID: 12429861
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Accurate reconstruction for DNA sequencing by hybridization based on a constructive heuristic.
    Chen Y; Hu J
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):1134-40. PubMed ID: 20855925
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A linear time algorithm for finding all maximal scoring subsequences.
    Ruzzo WL; Tompa M
    Proc Int Conf Intell Syst Mol Biol; 1999; ():234-41. PubMed ID: 10786306
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Reconstruction of strings past.
    Yee CN; Allison L
    Comput Appl Biosci; 1993 Feb; 9(1):1-7. PubMed ID: 8435759
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Optimal reconstruction of a sequence from its probes.
    Frieze AM; Preparata FP; Upfal E
    J Comput Biol; 1999; 6(3-4):361-8. PubMed ID: 10582572
    [TBL] [Abstract][Full Text] [Related]  

  • 26. An algorithm for the determination and quantification of components of nucleic acid mixtures based on single sequencing reactions.
    Pozhitkov A; Stemshorn K; Tautz D
    BMC Bioinformatics; 2005 Nov; 6():281. PubMed ID: 16316462
    [TBL] [Abstract][Full Text] [Related]  

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

  • 28. A Novel Hypergraph-Based Genetic Algorithm (HGGA) Built on Unimodular and Anti-homomorphism Properties for DNA Sequencing by Hybridization.
    Swaminathan V; Rajaram G; Abhishek V; Reddy BS; Kannan K
    Interdiscip Sci; 2019 Sep; 11(3):397-411. PubMed ID: 29110287
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Safe and Complete Contig Assembly Through Omnitigs.
    Tomescu AI; Medvedev P
    J Comput Biol; 2017 Jun; 24(6):590-602. PubMed ID: 27749096
    [TBL] [Abstract][Full Text] [Related]  

  • 30. A new algorithm for DNA sequence assembly.
    Idury RM; Waterman MS
    J Comput Biol; 1995; 2(2):291-306. PubMed ID: 7497130
    [TBL] [Abstract][Full Text] [Related]  

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

  • 32. Discovering sequence similarity by the algorithmic significance method.
    Milosavljević A
    Proc Int Conf Intell Syst Mol Biol; 1993; 1():284-91. PubMed ID: 7584347
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Positional sequencing by hybridization.
    Hannenhalli S; Feldman W; Lewis HF; Skiena SS; Pevzner PA
    Comput Appl Biosci; 1996 Feb; 12(1):19-24. PubMed ID: 8670615
    [TBL] [Abstract][Full Text] [Related]  

  • 34. A thermodynamic approach to designing structure-free combinatorial DNA word sets.
    Shortreed MR; Chang SB; Hong D; Phillips M; Campion B; Tulpan DC; Andronescu M; Condon A; Hoos HH; Smith LM
    Nucleic Acids Res; 2005; 33(15):4965-77. PubMed ID: 16284197
    [TBL] [Abstract][Full Text] [Related]  

  • 35. The fidelity of template-directed oligonucleotide ligation and its relevance to DNA computation.
    James KD; Boles AR; Henckel D; Ellington AD
    Nucleic Acids Res; 1998 Nov; 26(22):5203-11. PubMed ID: 9801320
    [TBL] [Abstract][Full Text] [Related]  

  • 36. String graph construction using incremental hashing.
    Ben-Bassat I; Chor B
    Bioinformatics; 2014 Dec; 30(24):3515-23. PubMed ID: 25183486
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Dealing with errors in interactive sequencing by hybridization.
    Phan VT; Skiena SS
    Bioinformatics; 2001 Oct; 17(10):862-70. PubMed ID: 11673230
    [TBL] [Abstract][Full Text] [Related]  

  • 38. A new graph model and algorithms for consistent superstring problems.
    Na JC; Cho S; Choi S; Kim JW; Park K; Sim JS
    Philos Trans A Math Phys Eng Sci; 2014 May; 372(2016):20130134. PubMed ID: 24751868
    [TBL] [Abstract][Full Text] [Related]  

  • 39. On approximate string matching of unique oligonucleotides.
    Hyyrö H; Vihinen M; Juhola M
    Stud Health Technol Inform; 2001; 84(Pt 2):960-4. PubMed ID: 11604874
    [TBL] [Abstract][Full Text] [Related]  

  • 40. The fragment assembly string graph.
    Myers EW
    Bioinformatics; 2005 Sep; 21 Suppl 2():ii79-85. PubMed ID: 16204131
    [TBL] [Abstract][Full Text] [Related]  

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