Остановите войну!
for scientists:
default search action
Sharma V. Thankachan
- > Home > Persons > Sharma V. Thankachan
Publications
- 2022
- [j47]Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru:
On the Hardness of Sequence Alignment on De Bruijn Graphs. J. Comput. Biol. 29(12): 1377-1396 (2022) - [c80]Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru:
The Complexity of Approximate Pattern Matching on de Bruijn Graphs. RECOMB 2022: 263-278 - [c78]Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru:
Feasibility of Flow Decomposition with Subpath Constraints in Linear Time. WABI 2022: 17:1-17:16 - [i12]Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru:
The Complexity of Approximate Pattern Matching on De Bruijn Graphs. CoRR abs/2201.12454 (2022) - 2020
- [j37]Sriram P. Chockalingam, Jodh Pannu, Sahar Hooshmand, Sharma V. Thankachan, Srinivas Aluru:
An alignment-free heuristic for fast sequence comparisons with applications to phylogeny reconstruction. BMC Bioinform. 21-S(6): 404 (2020) - [j35]Sriram P. Chockalingam, Sharma V. Thankachan, Srinivas Aluru:
Sequential and parallel algorithms for all-pair k-mismatch maximal common substrings. J. Parallel Distributed Comput. 144: 68-79 (2020) - 2018
- [c65]Sahar Hooshmand, Paniz Abedin, Daniel Gibney, Srinivas Aluru, Sharma V. Thankachan:
Faster Computation of Genome Mappability. BCB 2018: 537 - [c64]Jodh Pannu, Sriram P. Chockalingam, Sharma V. Thankachan, Srinivas Aluru:
An Alignment-free Heuristic for Fast Sequence Comparisons with Applications to Phylogeny Reconstruction. BCB 2018: 540 - [c58]Sahar Hooshmand, Paniz Abedin, Daniel Gibney, Srinivas Aluru, Sharma V. Thankachan:
Faster Computation of Genome Mappability with one Mismatch. ICCABS 2018: 1 - [c57]Sharma V. Thankachan, Chaitanya Aluru, Sriram P. Chockalingam, Srinivas Aluru:
Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis. RECOMB 2018: 211-224 - 2017
- [j25]Sharma V. Thankachan, Sriram P. Chockalingam, Yongchao Liu, Ambujam Krishnan, Srinivas Aluru:
A greedy alignment-free distance estimator for phylogenetic inference. BMC Bioinform. 18(8): 238:1-238:8 (2017) - 2016
- [j18]Sharma V. Thankachan, Sriram P. Chockalingam, Yongchao Liu, Alberto Apostolico, Srinivas Aluru:
ALFRED: A Practical Method for Alignment-Free Distance Computation. J. Comput. Biol. 23(6): 452-460 (2016) - [j17]Sharma V. Thankachan, Alberto Apostolico, Srinivas Aluru:
A Provably Efficient Algorithm for the k-Mismatch Average Common Substring Problem. J. Comput. Biol. 23(6): 472-482 (2016) - [c51]Sharma V. Thankachan, Sriram P. Chockalingam, Srinivas Aluru:
An Efficient Algorithm for Finding All Pairs k-Mismatch Maximal Common Substrings. ISBRA 2016: 3-14 - [c50]Sriram P. Chockalingam, Sharma V. Thankachan, Srinivas Aluru:
A parallel algorithm for finding all pairs k-mismatch maximal common substrings. SC 2016: 784-794 - 2015
- [c42]Inna Rytsareva, Seth Sims, Sriram P. Chockalingam, Srinivas Aluru, David S. Campo, Cansu Tetik, Sharma V. Thankachan, Yury Khudyakov, Yueli Zheng, Chirag Jain, Amanda Sue:
Efficient detection of viral transmission with threshold-based methods. ICCABS 2015: 1-6 - [c41]Sharma V. Thankachan, Sriram P. Chockalingam, Yongchao Liu, Ambujam Krishnan, Srinivas Aluru:
A greedy alignment-free distance estimator for phylogenetic inference (extended abstract). ICCABS 2015: 1 - [c38]Srinivas Aluru, Alberto Apostolico, Sharma V. Thankachan:
Efficient Alignment Free Sequence Comparison with Bounded Mismatches. RECOMB 2015: 1-12
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-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint