BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

175 related articles for article (PubMed ID: 22254463)

  • 1. ABS: Sequence alignment by scanning.
    Bonny T; Salama KN
    Annu Int Conf IEEE Eng Med Biol Soc; 2011; 2011():928-31. PubMed ID: 22254463
    [TBL] [Abstract][Full Text] [Related]  

  • 2. FOGSAA: Fast Optimal Global Sequence Alignment Algorithm.
    Chakraborty A; Bandyopadhyay S
    Sci Rep; 2013; 3():1746. PubMed ID: 23624407
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Sigma: multiple alignment of weakly-conserved non-coding DNA sequence.
    Siddharthan R
    BMC Bioinformatics; 2006 Mar; 7():143. PubMed ID: 16542424
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A fast Boyer-Moore type pattern matching algorithm for highly similar sequences.
    Ben Nsira N; Lecroq T; Elloumi M
    Int J Data Min Bioinform; 2015; 13(3):266-88. PubMed ID: 26547980
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Compression of Multiple DNA Sequences Using Intra-Sequence and Inter-Sequence Similarities.
    Cheng KO; Wu P; Law NF; Siu WC
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1322-32. PubMed ID: 26671804
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Segmentation algorithm for DNA sequences.
    Zhang CT; Gao F; Zhang R
    Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Oct; 72(4 Pt 1):041917. PubMed ID: 16383430
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Quaternionic periodicity transform: an algebraic solution to the tandem repeat detection problem.
    Brodzik AK
    Bioinformatics; 2007 Mar; 23(6):694-700. PubMed ID: 17237057
    [TBL] [Abstract][Full Text] [Related]  

  • 8. How does DNA sequence motif discovery work?
    D'haeseleer P
    Nat Biotechnol; 2006 Aug; 24(8):959-61. PubMed ID: 16900144
    [No Abstract]   [Full Text] [Related]  

  • 9. AntiClustal: Multiple Sequence Alignment by antipole clustering and linear approximate 1-median computation.
    Di Pietro C; Di Pietro V; Emmanuele G; Ferro A; Maugeri T; Modica E; Pigola G; Pulvirenti A; Purrello M; Ragusa M; Scalia M; Shasha D; Travali S; Zimmitti V
    Proc IEEE Comput Soc Bioinform Conf; 2003; 2():326-36. PubMed ID: 16452808
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Compressed pattern matching in DNA sequences.
    Chen L; Lu S; Ram J
    Proc IEEE Comput Syst Bioinform Conf; 2004; ():62-8. PubMed ID: 16448000
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Space-conserving optimal DNA-protein alignment.
    Ko P; Narayanan M; Kalyanaraman A; Aluru S
    Proc IEEE Comput Syst Bioinform Conf; 2004; ():80-8. PubMed ID: 16448002
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Homology assessment and molecular sequence alignment.
    Phillips AJ
    J Biomed Inform; 2006 Feb; 39(1):18-33. PubMed ID: 16380300
    [TBL] [Abstract][Full Text] [Related]  

  • 13. An improved heuristic algorithm for finding motif signals in DNA sequences.
    Huang CW; Lee WS; Hsieh SY
    IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):959-75. PubMed ID: 20855921
    [TBL] [Abstract][Full Text] [Related]  

  • 14. The generalised k-Truncated Suffix Tree for time-and space-efficient searches in multiple DNA or protein sequences.
    Schulz MH; Bauer S; Robinson PN
    Int J Bioinform Res Appl; 2008; 4(1):81-95. PubMed ID: 18283030
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Pattern locator: a new tool for finding local sequence patterns in genomic DNA sequences.
    Mrázek J; Xie S
    Bioinformatics; 2006 Dec; 22(24):3099-100. PubMed ID: 17095514
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Efficient filtering methods for clustering cDNAs with spliced sequence alignment.
    Shibuya T; Kashima H; Konagaya A
    Bioinformatics; 2004 Jan; 20(1):29-39. PubMed ID: 14693805
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A teaching approach from the exhaustive search method to the Needleman-Wunsch algorithm.
    Xu Z; Yang Y; Huang B
    Biochem Mol Biol Educ; 2017 May; 45(3):194-204. PubMed ID: 27740737
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Choosing the best heuristic for seeded alignment of DNA sequences.
    Sun Y; Buhler J
    BMC Bioinformatics; 2006 Mar; 7():133. PubMed ID: 16533404
    [TBL] [Abstract][Full Text] [Related]  

  • 19. PEAKS: identification of regulatory motifs by their position in DNA sequences.
    Bellora N; Farré D; Mar Albà M
    Bioinformatics; 2007 Jan; 23(2):243-4. PubMed ID: 17098773
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A profile-based deterministic sequential Monte Carlo algorithm for motif discovery.
    Liang KC; Wang X; Anastassiou D
    Bioinformatics; 2008 Jan; 24(1):46-55. PubMed ID: 18024972
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 9.