References
- A. Apostolico, D. Breslauer, and Z. Galil, Parallel dtection of all palindromes in a string', Theoretical Computer Science, 141:1, pp.163-173, 1995 https://doi.org/10.1016/0304-3975(94)00083-U
- A.H.L. Porto and V.C. Barbosa, Finding approximate palindromes in strings, Pattern Recognition 35, pp.2581-1591, 2002 https://doi.org/10.1016/S0031-3203(01)00179-0
- D. Breslauer and Z. Galil, Finding all periods and initial palindromes of a string in parallel, Algorithrnica 14:4, pp.355- 366, 1995 https://doi.org/10.1007/BF01294132
- D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, New York, NY, 1997
- Ganick, Larry, and M. Wheelis. The Cartoon Guide To Genetics. New York: Bames & Noble, pp.147-148, 1983
- J.A. Eisen, J.F. Heidelberg, O. White, and S.L. Salzberg, Evidence for symmetric chromosomal inversions around the replication origin in bacteria, Genome Biology 1(6), 2000 https://doi.org/10.1186/gb-2000-1-6-research0011
- J. Jurka, Origin and evaluation of alu repetitive elements, in R.J. Maraia (Ed.), The Impact of Short Interspersed Element (SINEs) on the Host Genome, R.G. Landes, New York, NY, pp.25-41, 1995
- J.T.L. Wang, Discovering active motifs in sets of related protein sequences and using them for classification, Nucleic Acids Research 22(14), pp.2769-2775, 1994 https://doi.org/10.1093/nar/22.14.2769
- K. Shishido, N. Komiyama, and S. Ikawa, Increased production of a knotted form of plasmid pbr322 DNA in Escherichia coli DNA topisomeraes mutants, Journal of Molecular Biology, pp.215-218, 2003
- L.J. Jensen, C. Friis, and D.W Ussery, Three view of microbial genomes, Res. Microbiol 150, pp.773-777, 1999 https://doi.org/10.1016/S0923-2508(99)00116-3
- National Center for Biotechnology Information, The complete genome sequence of Salmonella enterica serovar typhimurium LT2, http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?cmd= Retrieve&db =nucleotide&list_uids=16763390&dopt=GenBank, 2003
- National Center for Biotechnology Information, The complete genome sequence of Escherichia coli 0157, 2001, http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?cmd = Retrieve&db=nucleotide&list_uids=16445223&dopt=GenBank, 2003
- National Center for Biotechnology Information, The complete genome sequence of Escherichia coli K12, 1997, http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?cmd=Re trieve&db=nucleotide&list_uids=16127994&dopt=GenBank, 23 Apr. 2001
- S.F. Altschul, W. Gish, W. Miller, E.W. Myers, and D.J. Lipman, Basic locak alignment search tool, J. Mol. BioI. 215, pp.403-410, 1990 https://doi.org/10.1016/S0022-2836(05)80360-2
-
S.F. Altschul also claimed that BLAST will have O(
$N^2$ ) time complexity to find all palindromes, Personal email communication, July 29, 2003 - T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. New York: McGraw-Hill, pp.857-861, 1998
- T.L. Bailey, Discovering motifs in DNA and protein sequences, University of California at Sandiego (PhD dissertation), 1995
- T. Tsunoda, M. Fukagawa, and T. Takagi, Time and memory efficient algorithm for extracting palindromic and repetitive subsequences in nucleic acid sequences, Pacific Symposium on Biocomputing 4, pp.202-213, 1999
- X. Guan and E.C. Uberbacher, A fast look-up algorithm for detecting repetitive DNA sequences, Pacific Symposium on Biocomputing, Singapore, pp.718-719, 1996