Year |
Citation |
Score |
2020 |
Ryu H, Jung S, Pramanik S. An Effective Clustering Method over CF $^+$ + Tree Using Multiple Range Queries Ieee Transactions On Knowledge and Data Engineering. 32: 1694-1706. DOI: 10.1109/Tkde.2019.2911520 |
0.339 |
|
2020 |
Liu X, Zhu Q, Pramanik S, Brown CT, Qian G. VA-Store: A Virtual Approximate Store Approach to Supporting Repetitive Big Data in Genome Sequence Analyses Ieee Transactions On Knowledge and Data Engineering. 32: 602-616. DOI: 10.1109/Tkde.2018.2885952 |
0.531 |
|
2019 |
Islam AKMT, Pramanik S, Zhu Q. The BINDS-Tree: A Space-Partitioning Based Indexing Scheme for Box Queries in Non-Ordered Discrete Data Spaces Ieice Transactions On Information and Systems. 102: 745-758. DOI: 10.1587/Transinf.2018Dap0005 |
0.474 |
|
2019 |
Watve A, Pramanik S, Jung S, Lim CY. Data-independent vantage point selection for range queries The Journal of Supercomputing. 75: 7952-7978. DOI: 10.1007/S11227-018-2384-8 |
0.758 |
|
2015 |
Islam AT, Ji X, Pramanik S, Zhu Q, Cole JR. Back translated peptide k-mer search on disk F1000research. 4. DOI: 10.7490/F1000Research.1110278.1 |
0.38 |
|
2015 |
Watve A, Pramanik S, Shahid S, Meiners CR, Liu AX. Topological transformation approaches to database query processing Ieee Transactions On Knowledge and Data Engineering. 27: 1438-1451. DOI: 10.1109/Tkde.2014.2363658 |
0.772 |
|
2015 |
Islam AKMT, Pramanik S, Ji X, Cole JR, Zhu Q. Back translated peptide K-mer search and local alignment in large DNA sequence databases using BoND-SD-tree indexing 2015 Ieee 15th International Conference On Bioinformatics and Bioengineering, Bibe 2015. DOI: 10.1109/BIBE.2015.7367638 |
0.377 |
|
2014 |
Kolbe D, Zhu Q, Pramanik S. K-Nearest neighbor searching in hybrid spaces Information Systems. 43: 55-64. DOI: 10.1016/J.Is.2014.02.004 |
0.732 |
|
2013 |
Chen C, Watve A, Pramanik S, Zhu Q. The BoND-tree: An efficient indexing method for box queries in nonordered discrete data spaces Ieee Transactions On Knowledge and Data Engineering. 25: 2629-2643. DOI: 10.1109/Tkde.2012.132 |
0.795 |
|
2012 |
Shahid S, Pramanik S, Owen CB. Minimum bounding boxes for regular cross-polytopes Proceedings of the Acm Symposium On Applied Computing. 879-884. DOI: 10.1145/2245276.2245447 |
0.554 |
|
2011 |
Gupta R, Ghosh SK, Sural S, Pramanik S. Hybrid index-based image search from the web International Journal of Data Mining, Modelling and Management. 3: 252-276. DOI: 10.1504/Ijdmmm.2011.041809 |
0.449 |
|
2010 |
Kolbe D, Zhu Q, Pramanik S. Efficient k-nearest neighbor searching in nonordered discrete data spaces Acm Transactions On Information Systems. 28. DOI: 10.1145/1740592.1740595 |
0.741 |
|
2010 |
Kolbe D, Zhu Q, Pramanik S. Reducing non-determinism of k-NN searching in non-ordered discrete data spaces Information Processing Letters. 110: 420-423. DOI: 10.1016/J.Ipl.2010.03.013 |
0.736 |
|
2009 |
Kumar S, Sural S, Watve A, Pramanik S. CNODE: Clustering of set-valued non-ordered discrete data International Journal of Data Mining, Modelling and Management. 1: 310-334. DOI: 10.1504/Ijdmmm.2009.027288 |
0.741 |
|
2006 |
Qian G, Zhu Q, Xue Q, Pramanik S. Dynamic indexing for multidimensional non-ordered discrete data spaces using a data-partitioning approach Acm Transactions On Database Systems. 31: 439-484. DOI: 10.1145/1138394.1138395 |
0.521 |
|
2006 |
Qian G, Zhu Q, Xue Q, Pramanik S. A space-partitioning-based indexing method for multidimensional non-ordered discrete data spaces Acm Transactions On Information Systems. 24: 79-110. DOI: 10.1145/1125857.1125860 |
0.531 |
|
2005 |
Xue Q, Pramanik S, Qiang G, Zhu Q. A hybrid index structure for querying large string databases International Journal of Electronic Business. 3: 243-254. DOI: 10.1504/Ijeb.2005.007269 |
0.474 |
|
2005 |
Jung S, Lee B, Pramanik S. A tree-structured index allocation method with replication over multiple broadcast channels in wireless environments Ieee Transactions On Knowledge and Data Engineering. 17: 311-325. DOI: 10.1109/Tkde.2005.36 |
0.344 |
|
2002 |
Jung S, Pramanik S. An efficient path computation model for hierarchically structured topographical road maps Ieee Transactions On Knowledge and Data Engineering. 14: 1029-1046. DOI: 10.1109/Tkde.2002.1033772 |
0.357 |
|
1999 |
Zhong Y, Luo Y, Pramanik S, Beaman JH. HICLAS: a taxonomic database system for displaying and comparing biological classification and phylogenetic trees. Bioinformatics. 15: 149-156. PMID 10089200 DOI: 10.1093/Bioinformatics/15.2.149 |
0.395 |
|
1999 |
Maidak BL, Cole JR, Parker CT, Garrity GM, Larsen N, Li B, Lilburn TG, McCaughey MJ, Olsen GJ, Overbeek R, Pramanik S, Schmidt TM, Tiedje JM, Woese CR. A new version of the RDP (Ribosomal Database Project). Nucleic Acids Research. 27: 171-3. PMID 9847171 DOI: 10.1093/Nar/27.1.171 |
0.339 |
|
1997 |
Zhong Y, Meacham CA, Pramanik S. A general method for tree-comparison based on subtree similarity and its use in a taxonomic database Biosystems. 42: 1-8. PMID 9146830 DOI: 10.1016/S0303-2647(97)01684-5 |
0.382 |
|
1997 |
Pramanik S, Tout WR. The NUMA with clusters of processors for parallel join Ieee Transactions On Knowledge and Data Engineering. 9: 653-660. DOI: 10.1109/69.617058 |
0.346 |
|
1997 |
Larsen N, Overbeek R, Pramanik S, Schmidt TM, Selkov EE, Strunk O, Tiedje JM, Urbance JW. Towards microbial data integration Journal of Industrial Microbiology and Biotechnology. 18: 68-72. DOI: 10.1038/Sj.Jim.2900366 |
0.357 |
|
1996 |
Kim J, Cole JR, Pramanik S. Alignment of possible secondary structures in multiple RNA sequences using simulated annealing. Computer Applications in the Biosciences : Cabios. 12: 259-67. PMID 8902352 DOI: 10.1093/Bioinformatics/12.4.259 |
0.33 |
|
1996 |
Zhong Y, Jung S, Pramanik S, Beaman JH. Data model and comparison and query methods for interacting classifications in a taxonomic database Taxon. 45: 223-241. DOI: 10.2307/1224663 |
0.418 |
|
1996 |
Pramanik S, Jung S. Description and identification of distributed fragments of recursive relations Ieee Transactions On Knowledge and Data Engineering. 8: 1002-1016. DOI: 10.1109/69.553168 |
0.349 |
|
1995 |
Jung S, Perkins S, Zhong Y, Pramanik S, Beaman J. A new data model for biological classification Bioinformatics. 11: 237-246. PMID 7583691 DOI: 10.1093/Bioinformatics/11.3.237 |
0.356 |
|
1994 |
Kim J, Pramanik S, Chung MJ. Multiple sequence alignment using simulated annealing Bioinformatics. 10: 419-426. PMID 7804875 DOI: 10.1093/Bioinformatics/10.4.419 |
0.321 |
|
1993 |
Pramanik S, Analyti A, Davies H, Chou H. Multi-directory hashing Information Systems. 18: 63-74. DOI: 10.1016/0306-4379(93)90043-Z |
0.363 |
|
1993 |
Analyti A, Pramanik S. Performance analysis of a main memory multi-directory hashing technique Information Processing Letters. 45: 191-197. DOI: 10.1016/0020-0190(93)90118-S |
0.306 |
|
1992 |
Ho Kim M, Pramanik S. Optimizing database accesses for parallel processing of multikey range searches Computer Journal. 35: 45-51. DOI: 10.1093/Comjnl/35.1.45 |
0.389 |
|
1991 |
Kim MH, Pramanik S. The FX distribution method for parallel processing of partial match queries Information Processing Letters. 38: 243-252. DOI: 10.1016/0020-0190(91)90066-Q |
0.393 |
|
1990 |
Pramanik S, Kim MH. Parallel Processing of Large Node B-Trees Ieee Transactions On Computers. 39: 1208-1212. DOI: 10.1109/12.57061 |
0.3 |
|
1988 |
Pramanik S, Fotouhi F. Optimizing the cost of relational queries using Partial-Relation schemes Information Systems. 13: 71-79. DOI: 10.1016/0306-4379(88)90028-2 |
0.407 |
|
1986 |
Pramanik S, Fotouhi F. INDEX DATABASE MACHINE Computer Journal. 29: 451-457. DOI: 10.1093/Comjnl/29.5.451 |
0.35 |
|
1985 |
Pramanik S, Ittner D. Use of Graph-Theoretic Models for Optimal Relational Database Accesses to Perform Join Acm Transactions On Database Systems (Tods). 10: 57-74. DOI: 10.1145/3148.3325 |
0.324 |
|
Show low-probability matches. |