The generalised k-Truncated Suffix Tree for time-and space-efficient searches in multiple DNA or protein sequences

Author： Schulz Marcel H.   Bauer Sebastian   Robinson Peter N.  

Publisher： Inderscience Publishers

ISSN： 1744-5485

Source： International Journal of Bioinformatics Research and Applications, Vol.4, Iss.1, 2008-02, pp. : 81-95

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The game of chess and searches in protein sequence space

By Mandecki W.  

Trends in Biotechnology, Vol. 16, Iss. 5, 1998-12 ,pp. : 200-202

Elsevier

Access to resources Recommend Favorite

A Lossless Compression Algorithm for DNA sequences

By Soliman Taysir H.A.   Gharib Tarek F.   Abo-Alian Alshaimaa   Sharkawy M.A. El  

International Journal of Bioinformatics Research and Applications, Vol. 5, Iss. 6, 2009-10 ,pp. : 593-602

Inderscience Publishers

Access to resources Recommend Favorite

Searching a pattern in compressed DNA sequences

By Gupta Ashutosh   Agarwal Suneeta  

International Journal of Bioinformatics Research and Applications, Vol. 7, Iss. 2, 2011-05 ,pp. : 115-129

Inderscience Publishers

Access to resources Recommend Favorite

Design of DNA Sequences for Stable DNA Tile

By Wang Yanfeng   Shi Ruihui   Wang Zicheng   Zhang Xuncai   Cui Guangzhao  

Journal of Bionanoscience, Vol. 7, Iss. 3, 2013-06 ,pp. : 265-270

American Scientific Publishers

Access to resources Recommend Favorite

Efficient evaluation of radial queries using the target tree

By Morse Michael   Patel Jignesh M.   Grosky William I.  

International Journal of Bioinformatics Research and Applications, Vol. 3, Iss. 1, 2006-12 ,pp. : 24-41

Inderscience Publishers

Access to resources Recommend Favorite