![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Sandeep Tata Sandeep Tata, Jignesh M. Patel , James S. Friedman , Anand Swaroop : Declarative Querying for Biological Sequences. ICDE 2006 : 87 Yuanyuan Tian , Sandeep Tata, Richard A. Hankins , Jignesh M. Patel : Practical methods for constructing suffix trees. VLDB J. 14 (3): 281-299 (2005) Sandeep Tata, Richard A. Hankins , Jignesh M. Patel : Practical Suffix Tree Construction. VLDB 2004 : 36-47 Sandeep Tata, Jignesh M. Patel : PiQA: An Algebra for Querying Protein Data Sets. SSDBM 2003 : 141-150 1 [ 4 ] 2 [ 2 ] [ 3 ] 3 [ 1 ] [ 2 ] [ 3 ] [ 4 ] 4 [ 4 ] 5 [ 3 ] ![]() ©2006 Association for Computing Machinery |