Year |
Citation |
Score |
2016 |
Biswas A, Ranjan D, Zubair M, Zeil S, Al Nasr K, He J. An Effective Computational Method Incorporating Multiple Secondary Structure Predictions in Topology Determination for Cryo-EM Images. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. PMID 27008671 DOI: 10.1109/Tcbb.2016.2543721 |
0.308 |
|
2015 |
Biswas A, Ranjan D, Zubair M, He J. A Dynamic Programming Algorithm for Finding the Optimal Placement of a Secondary Structure Topology in Cryo-EM Data. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 22: 837-43. PMID 26244416 DOI: 10.1089/Cmb.2015.0120 |
0.351 |
|
2014 |
Al Nasr K, Ranjan D, Zubair M, Chen L, He J. Solving the Secondary Structure Matching Problem in Cryo-EM De Novo Modeling Using a Constrained K-Shortest Path Graph Algorithm. Ieee/Acm Transactions On Computational Biology and Bioinformatics / Ieee, Acm. 11: 419-30. PMID 26355788 DOI: 10.1109/Tcbb.2014.2302803 |
0.36 |
|
2013 |
Dasari NS, Ranjan D, Zubair M. High-performance implementation of planted motif problem on multicore and GPU Concurrency Computation Practice and Experience. 25: 1340-1355. DOI: 10.1002/Cpe.2935 |
0.325 |
|
2012 |
Biswas A, Si D, Al Nasr K, Ranjan D, Zubair M, He J. Improved efficiency in cryo-EM secondary structure topology determination from inaccurate data. Journal of Bioinformatics and Computational Biology. 10: 1242006. PMID 22809382 DOI: 10.1142/S0219720012420061 |
0.301 |
|
2011 |
Al Nasr K, Ranjan D, Zubair M, He J. Ranking valid topologies of the secondary structure elements using a constraint graph. Journal of Bioinformatics and Computational Biology. 9: 415-30. PMID 21714133 DOI: 10.1142/S0219720011005604 |
0.342 |
|
2006 |
Dal Palú A, Pontelli E, Ranjan D. Sequential and parallel algorithms for the NCA problem on pure pointer machines Theoretical Computer Science. 352: 108-135. DOI: 10.1016/J.Tcs.2005.10.040 |
0.39 |
|
2005 |
Pontelli E, Ranjan D. A simple optimal solution for the temporal precedence problem on pure pointer machines Theory of Computing Systems. 38: 115-130. DOI: 10.1007/S00224-004-1118-X |
0.359 |
|
2003 |
Ranjan D, Pontelli E. The Level-Ancestor problem on Pure Pointer Machines Information Processing Letters. 85: 275-283. DOI: 10.1016/S0020-0190(02)00428-3 |
0.334 |
|
2002 |
Futamura N, Aluru S, Ranjan D, Hariharan B. Efficient parallel algorithms for solvent accessible surface area of proteins Ieee Transactions On Parallel and Distributed Systems. 13: 544-555. DOI: 10.1109/Tpds.2002.1011399 |
0.323 |
|
2002 |
Pontelli E, Ranjan D, Palú AD. An optimal data structure to handle dynamic environments in non-deterministic computations Computer Languages. 28: 181-201. DOI: 10.1016/S0096-0551(02)00004-8 |
0.367 |
|
2000 |
Ranjan D, Pontelli E, Gupta G, Longpre L. The temporal precedence problem Algorithmica (New York). 28: 288-306. DOI: 10.1007/S004530010036 |
0.346 |
|
1999 |
Ranjan D, Pontelli E, Gupta G. On the complexity of or-parallelism New Generation Computing. 17: 285-307. DOI: 10.1007/Bf03037223 |
0.348 |
|
1998 |
Dubhashi D, Ranjan D. Balls and bins: A study in negative dependence Random Structures and Algorithms. 13: 99-124. DOI: 10.7146/Brics.V3I25.20006 |
0.308 |
|
1998 |
Ranjan D, Pontelli E, Gupta G. Efficient algorithms for the temporal precedence problem Information Processing Letters. 68: 71-78. DOI: 10.1016/S0020-0190(98)00141-0 |
0.325 |
|
1998 |
Harary F, Ranjan D. Breaking symmetry in complete graphs by orienting edges: Asymptotic bounds Information Processing Letters. 67: 227-230. DOI: 10.1016/S0020-0190(98)00124-0 |
0.349 |
|
1998 |
Pontelli E, Ranjan D, Gupta G. The complexity of late-binding in dynamic object-oriented languages Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1490: 213-229. DOI: 10.1007/Bfb0056616 |
0.355 |
|
1993 |
Panconesi A, Ranjan D. Quantifiers and approximation Theoretical Computer Science. 107: 145-163. DOI: 10.1016/0304-3975(93)90259-V |
0.332 |
|
1993 |
Ranjan D, Chari S, Rohatgi P. Improving known solutions is hard Computational Complexity. 3: 168-185. DOI: 10.1007/Bf01200119 |
0.34 |
|
Show low-probability matches. |