On finding minimal absent words

BMC Bioinformatics

Volumn 10, Issue , 2009, Pages

  Pinho, Armando J ^a   Ferreira, Paulo J S G ^a   Garcia, Sara P ^a   Rodrigues, João M O S ^a  

^a UNIVERSITY OF AVEIRO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

DNA DATA; LINEAR TIME;

ALGORITHMS;

DNA;

ACCESS TO INFORMATION; ARTICLE; CAENORHABDITIS ELEGANS; DATA ANALYSIS; DNA DETERMINATION; DROSOPHILA MELANOGASTER; HUMAN; INFORMATION PROCESSING; INTERNET; MATHEMATICAL ANALYSIS; METHANOCOCCUS JANNASCHII; MYCOPLASMA GENITALIUM; NEUROSPORA CRASSA; NONHUMAN; NUCLEOTIDE SEQUENCE; SACCHAROMYCES CEREVISIAE; STAPHYLOCOCCUS AUREUS; ALGORITHM; CHEMISTRY; DNA SEQUENCE; GENOMICS; METHODOLOGY; NUCLEIC ACID DATABASE;

ALGORITHMS; BASE SEQUENCE; DATABASES, NUCLEIC ACID; DNA; GENOMICS; SEQUENCE ANALYSIS, DNA;

EID: 67650878985     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-10-137     Document Type: Article

References (18)

1. Hampikian G Andersen T Absent sequences: Nullomers and primes Pacific Symposium on Biocomputing 2007, 12:355-366.
2. Acquisti C Poste G Curtiss D Kumar S Nullomers: Really a matter of natural selection? PLoS ONE 2007, 2:10. 1995752 17925870
3. Herold J Kurtz S Giegerich R Efficient computation of absent words in genomic sequences BMC Bioinformatics 2008, 9:167. 2375138 18366790
4. Gusfield D Algorithms on strings, trees, and sequences: Computer science and computational biology Cambridge: Cambridge University Press 1997.
5. Weiner P Linear pattern matching algorithm 14th Annual IEEE Symposium on Switching and Automata Theory 1973:1-11.
6. McCreight EM A space-economical suffix tree construction algorithm Journal of the ACM 1976, 23(2):262-272.
7. Ukkonen E On-line construction of suffix trees Algorithmica 1995, 14(3):249-260.
8. Kurtz S Reducing the space requirement of suffix trees Software-Practice and Experience 1999, 29(13):1149-1171.
9. Abouelhoda MI Kurtz S Ohlebusch E Enhanced suffix arrays and applications Handbook of Computational Molecular Biology, Computer and Information Science Series Chapman & All/CRC Aluru S 2006.
10. Manber U Myers G Suffix arrays: A new method for on-line string searches Proc of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms 1990:319-327.
11. Manber U Myers G Suffix arrays: A new method for on-line string searches SIAM Journal on Computing 1993, 22(5):935-948.
12. Kärkkäinen J Sanders P Simple linear work suffix array construction Proc 30th Int Conf on Automata, Languages and Programming of LNCS Springer-Verlag 2003, 2719:943-955.
13. Kim DK Sim JS Park H Park K Linear-time construction of suffix arrays Combinatorial Pattern Matching: Proc. of the 14th Annual Symposium, LNCS Springer-Verlag 2003, 2676:186-199.
14. Kim DK Sim JS Park H Park K Space efficient linear time construction of suffix arrays Combinatorial Pattern Matching: Proc. of the 14th Annual Symposium, of LNCS Springer-Verlag 2003, 2656:200-210.
15. Burrows M Wheeler DJ A block-sorting lossless data compression algorithm Digital Systems Research Center 1994.
16. Abouelhoda MI Kurtz S Ohlebusch E The enhanced suffix array and its applications to genome analysis Algorithms in Bioinformatics: Proc. of the 2nd Workshop, of LNCS Rome, Italy: Springer-Verlag 2002, 2452:449-463.
17. Kasai T Lee G Arimura H Arikawa S Park K Linear-time longest-common-prefix computation in suffix arrays and its applications Combinatorial Pattern Matching: Proc. of the 12th Annual Symposium, of LNCS Springer-Verlag 2001 2089:182-192.
18. Shi F Suffix arrays for multiple strings: A method for on-line multiple string searches Concurrency and Parallelism, Programming, Networking, and Security: 2nd Asian Computing Science Conference, ASIAN'96, of LNCS Springer-Verlag 1996, 1179:11-22.