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 *

146 related articles for article (PubMed ID: 12075023)

  • 21. ParAlign: a parallel sequence alignment algorithm for rapid and sensitive database searches.
    Rognes T
    Nucleic Acids Res; 2001 Apr; 29(7):1647-52. PubMed ID: 11266569
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Nested Containment List (NCList): a new algorithm for accelerating interval query of genome alignment and interval databases.
    Alekseyenko AV; Lee CJ
    Bioinformatics; 2007 Jun; 23(11):1386-93. PubMed ID: 17234640
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Accelerating approximate subsequence search on large protein sequence databases.
    Yang J; Wang W; Xia Y; Yu PS
    Proc IEEE Comput Soc Bioinform Conf; 2002; 1():207-16. PubMed ID: 15838137
    [TBL] [Abstract][Full Text] [Related]  

  • 24. MONI: A Pangenomic Index for Finding Maximal Exact Matches.
    Rossi M; Oliva M; Langmead B; Gagie T; Boucher C
    J Comput Biol; 2022 Feb; 29(2):169-187. PubMed ID: 35041495
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Removing near-neighbour redundancy from large protein sequence collections.
    Holm L; Sander C
    Bioinformatics; 1998 Jun; 14(5):423-9. PubMed ID: 9682055
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Profiling the BLAST bioinformatics application for load balancing on high-performance computing clusters.
    Cheng T; Chin PJ; Cha K; Petrick N; Mikailov M
    BMC Bioinformatics; 2022 Dec; 23(1):544. PubMed ID: 36526957
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Rapid match-searching for gene silencing assessment.
    Horn ME; Waterhouse PM
    Bioinformatics; 2010 Aug; 26(16):1932-7. PubMed ID: 20601440
    [TBL] [Abstract][Full Text] [Related]  

  • 28. A workbench for large-scale sequence homology analysis.
    Sonnhammer EL; Durbin R
    Comput Appl Biosci; 1994 Jun; 10(3):301-7. PubMed ID: 7922687
    [TBL] [Abstract][Full Text] [Related]  

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

  • 30. A Fast Exact k-Nearest Neighbors Algorithm for High Dimensional Search Using k-Means Clustering and Triangle Inequality.
    Wang X
    Proc Int Jt Conf Neural Netw; 2012 Feb; 43(6):2351-2358. PubMed ID: 22247818
    [TBL] [Abstract][Full Text] [Related]  

  • 31. miBLAST: scalable evaluation of a batch of nucleotide sequence queries with BLAST.
    Kim YJ; Boyd A; Athey BD; Patel JM
    Nucleic Acids Res; 2005; 33(13):4335-44. PubMed ID: 16061938
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Refined repetitive sequence searches utilizing a fast hash function and cross species information retrievals.
    Reneker J; Shyu CR
    BMC Bioinformatics; 2005 May; 6():111. PubMed ID: 15869708
    [TBL] [Abstract][Full Text] [Related]  

  • 33. A table-driven, full-sensitivity similarity search algorithm.
    Myers G; Durbin R
    J Comput Biol; 2003; 10(2):103-17. PubMed ID: 12804086
    [TBL] [Abstract][Full Text] [Related]  

  • 34. A deterministic DNA database search.
    Kheniche A; Salhi A; Harrison A; Dowden JM
    Adv Exp Med Biol; 2010; 680():371-8. PubMed ID: 20865521
    [TBL] [Abstract][Full Text] [Related]  

  • 35. SANS: high-throughput retrieval of protein sequences allowing 50% mismatches.
    Koskinen JP; Holm L
    Bioinformatics; 2012 Sep; 28(18):i438-i443. PubMed ID: 22962464
    [TBL] [Abstract][Full Text] [Related]  

  • 36. PowerBLAST: a new network BLAST application for interactive or automated sequence analysis and annotation.
    Zhang J; Madden TL
    Genome Res; 1997 Jun; 7(6):649-56. PubMed ID: 9199938
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Using a FASTA Sequence Database Similarity Search.
    Mount DW
    CSH Protoc; 2007 Jul; 2007():pdb.top16. PubMed ID: 21357134
    [TBL] [Abstract][Full Text] [Related]  

  • 38. MAP: searching large genome databases.
    Kahveci T; Singh A
    Pac Symp Biocomput; 2003; ():303-14. PubMed ID: 12603037
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Finding the nearest neighbors in biological databases using less distance computations.
    Zhou J; Sander J; Cai Z; Wang L; Lin G
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(4):669-80. PubMed ID: 21030734
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Evaluating DNA sequence searching algorithms on multicore.
    Weng N; Soewito B
    Int J Comput Biol Drug Des; 2008; 1(3):313-27. PubMed ID: 20054996
    [TBL] [Abstract][Full Text] [Related]  

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