Format
Items per page
Sort by

Send to:

Choose Destination

Links from PubMed

Items: 1 to 20 of 68

1.

Absent sequences: nullomers and primes.

Hampikian G, Andersen T.

Pac Symp Biocomput. 2007:355-66.

2.

SIMD parallelization of the WORDUP algorithm for detecting statistically significant patterns in DNA sequences.

Liuni S, Prunella N, Pesole G, D'Orazio T, Stella E, Distante A.

Comput Appl Biosci. 1993 Dec;9(6):701-7.

PMID:
8143157
3.

Frequency-domain analysis of biomolecular sequences.

Anastassiou D.

Bioinformatics. 2000 Dec;16(12):1073-81.

4.

CSA: an efficient algorithm to improve circular DNA multiple alignment.

Fernandes F, Pereira L, Freitas AT.

BMC Bioinformatics. 2009 Jul 23;10:230. doi: 10.1186/1471-2105-10-230.

5.

Nullomers: really a matter of natural selection?

Acquisti C, Poste G, Curtiss D, Kumar S.

PLoS One. 2007 Oct 10;2(10):e1022.

6.

Paircomp, FamilyRelationsII and Cartwheel: tools for interspecific sequence comparison.

Brown CT, Xie Y, Davidson EH, Cameron RA.

BMC Bioinformatics. 2005 Mar 24;6:70.

7.

Continued colonization of the human genome by mitochondrial DNA.

Ricchetti M, Tekaia F, Dujon B.

PLoS Biol. 2004 Sep;2(9):E273. Epub 2004 Sep 7.

8.

GCG: assembly of sequences into new sequence constructs.

Dölz R.

Methods Mol Biol. 1994;24:57-63. No abstract available.

PMID:
8205208
9.

New method for yeast identification using Burrows-Wheeler transform.

Pokrzywa R.

J Bioinform Comput Biol. 2008 Apr;6(2):403-13.

PMID:
18464330
10.

Genome comparison without alignment using shortest unique substrings.

Haubold B, Pierstorff N, Möller F, Wiehe T.

BMC Bioinformatics. 2005 May 23;6:123.

11.

Identification of functional elements in unaligned nucleic acid sequences by a novel tuple search algorithm.

Wolfertstetter F, Frech K, Herrmann G, Werner T.

Comput Appl Biosci. 1996 Feb;12(1):71-80.

PMID:
8670622
12.
13.

Efficient identification of DNA hybridization partners in a sequence database.

Mann TP, Noble WS.

Bioinformatics. 2006 Jul 15;22(14):e350-8.

14.

An algorithm for finding signals of unknown length in DNA sequences.

Pavesi G, Mauri G, Pesole G.

Bioinformatics. 2001;17 Suppl 1:S207-14.

15.

Optimal word sizes for dissimilarity measures and estimation of the degree of dissimilarity between DNA sequences.

Wu TJ, Huang YH, Li LA.

Bioinformatics. 2005 Nov 15;21(22):4125-32. Epub 2005 Sep 6.

16.

Specialized microbial databases for inductive exploration of microbial genome sequences.

Fang G, Ho C, Qiu Y, Cubas V, Yu Z, Cabau C, Cheung F, Moszer I, Danchin A.

BMC Genomics. 2005 Feb 7;6:14.

17.

Prediction of probable genes by Fourier analysis of genomic sequences.

Tiwari S, Ramachandran S, Bhattacharya A, Bhattacharya S, Ramaswamy R.

Comput Appl Biosci. 1997 Jun;13(3):263-70.

PMID:
9183531
18.

Computational inference of homologous gene structures in the human genome.

Yeh RF, Lim LP, Burge CB.

Genome Res. 2001 May;11(5):803-16.

19.

Predictive methods using nucleotide sequences.

Fickett JW.

Methods Biochem Anal. 1998;39:231-45. No abstract available.

PMID:
9707933
20.

Biological sequence compression algorithms.

Matsumoto T, Sadakane K, Imai H.

Genome Inform Ser Workshop Genome Inform. 2000;11:43-52.

PMID:
11700586
Format
Items per page
Sort by

Send to:

Choose Destination

Supplemental Content

Write to the Help Desk