default search action
Soumitra Pal 0001
Person information
- affiliation: Indian Institute of Technology Bombay, Powai, Mumbai, India
Other persons with the same name
- Soumitra Pal 0002
— Hong Kong University of Science and Technology, Department of Electronic and Computer Engineering, Hong Kong (and 1 more)
- Soumitra Pal 0003 — Banaras Hindu University, Institute of Science, Department of Mathematics, Varanasi, India
- Soumitra Pal 0004 — University of California, Los Angeles, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j9]Soumitra Pal, Brian Oliver, Teresa M. Przytycka
Stochastic Modeling of Gene Expression Evolution Uncovers Tissue- and Sex-Specific Properties of Expression Evolution in the Drosophila Genus. J. Comput. Biol. 30(1): 21-40 (2023) - 2020
- [j8]Soumitra Pal
Bioinformatics pipeline using JUDI: Just Do It! Bioinform. 36(8): 2572-2574 (2020) - [j7]Soumitra Pal
Hybrid-DCA: A double asynchronous approach for stochastic dual coordinate ascent. J. Parallel Distributed Comput. 143: 47-66 (2020)
2010 – 2019
- 2019
- [j6]Subrata Saha, Jethro Johnson, Soumitra Pal, George M. Weinstock, Sanguthevar Rajasekaran:
MSC: a metagenomic sequence classification algorithm. Bioinform. 35(17): 2932-2940 (2019) - 2017
- [j5]Peng Xiao, Soumitra Pal, Sanguthevar Rajasekaran:
Randomised sequential and parallel algorithms for efficient quorum planted motif search. Int. J. Data Min. Bioinform. 18(2): 105-124 (2017) - 2016
- [j4]Abdullah-Al Mamun, Soumitra Pal
KCMBT: a k-mer Counter based on Multiple Burst Trees. Bioinform. 32(18): 2783-2790 (2016) - [c6]Peng Xiao, Soumitra Pal
qPMS10: A randomized algorithm for efficiently solving quorum Planted Motif Search problem. BIBM 2016: 670-675 - [c5]Soumitra Pal
On Speeding-Up Parallel Jacobi Iterations for SVDs. HPCC/SmartCity/DSS 2016: 9-16 - [i4]Soumitra Pal, Tingyang Xu, Tianbao Yang, Sanguthevar Rajasekaran, Jinbo Bi:
Hybrid-DCA: A Double Asynchronous Approach for Stochastic Dual Coordinate Ascent. CoRR abs/1610.07184 (2016) - 2015
- [j3]Soumitra Pal
In search of perfect reads. BMC Bioinform. 16(S17): S7 (2015) - [j2]Ajit A. Diwan, Soumitra Pal
Fragmented coloring of proper interval and split graphs. Discret. Appl. Math. 193: 110-118 (2015) - [c4]Soumitra Pal
Improved algorithms for finding edit distance based motifs. BIBM 2015: 537-542 - [c3]Abdullah-Al Mamun, Soumitra Pal
Efficient techniques for k-mer counting. ICCABS 2015: 1 - 2014
- [c2]Soumitra Pal
In search of perfect reads. ICCABS 2014: 1-2 - 2013
- [c1]Vijay Arya, T. S. Jayram, Soumitra Pal
Inferring connectivity model from meter measurements in distribution networks. e-Energy 2013: 173-182 - 2012
- [j1]Soumitra Pal
Scheduling light-trails on WDM rings. J. Parallel Distributed Comput. 72(10): 1226-1236 (2012) - [i3]Ajit A. Diwan, Soumitra Pal, Abhiram Ranade:
Component Coloring of Proper Interval Graphs and Split Graphs. CoRR abs/1201.3273 (2012) - 2011
- [i2]T. S. Jayram, Soumitra Pal, Vijay Arya:
Recovery of a Sparse Integer Solution to an Underdetermined System of Linear Equations. CoRR abs/1112.1757 (2011) - [i1]Soumitra Pal, Abhiram Ranade:
Scheduling Light-trails in WDM Rings. CoRR abs/1112.6254 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-11 17:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: