default search action
Marius Nicolae
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [p1]Sudha Balla, Jaime I. Dávila, Marius Nicolae, Sanguthevar Rajasekaran:
Approximation Algorithms for the Primer Selection, PlantedMotif Search, and Related Problems. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - 2017
- [j6]Marius Nicolae
, Sanguthevar Rajasekaran:
On pattern matching with k mismatches and few don't cares. Inf. Process. Lett. 118: 78-82 (2017) - 2016
- [c5]Sanguthevar Rajasekaran, Marius Nicolae:
An Error Correcting Parser for Context Free Grammars that Takes Less Than Cubic Time. LATA 2016: 533-546 - [i6]Marius Nicolae, Sanguthevar Rajasekaran:
On pattern matching with k mismatches and few don't cares. CoRR abs/1602.00621 (2016) - 2015
- [j5]Marius Nicolae, Sanguthevar Rajasekaran:
On String Matching with Mismatches. Algorithms 8(2): 248-270 (2015) - 2014
- [j4]Marius Nicolae, Sanguthevar Rajasekaran:
Efficient Sequential and Parallel Algorithms for Planted Motif Search. BMC Bioinform. 15: 34 (2014) - [j3]Sanguthevar Rajasekaran, Marius Nicolae:
An elegant algorithm for the construction of suffix arrays. J. Discrete Algorithms 27: 21-28 (2014) - [i5]Sanguthevar Rajasekaran, Marius Nicolae:
An error correcting parser for context free grammars that takes less than cubic time. CoRR abs/1406.3405 (2014) - 2013
- [j2]Sudipta Pathak, Sanguthevar Rajasekaran, Marius Nicolae:
Ems1: an Elegant Algorithm for Edit Distance Based Motif Search. Int. J. Found. Comput. Sci. 24(4): 473-486 (2013) - [i4]Marius Nicolae, Sanguthevar Rajasekaran:
Efficient Sequential and Parallel Algorithms for Planted Motif Search. CoRR abs/1307.0571 (2013) - [i3]Marius Nicolae, Sanguthevar Rajasekaran:
On string matching with k mismatches. CoRR abs/1307.1406 (2013) - [i2]Sanguthevar Rajasekaran, Marius Nicolae:
An Elegant Algorithm for the Construction of Suffix Arrays. CoRR abs/1307.1417 (2013) - 2011
- [j1]Marius Nicolae, Serghei Mangul, Ion I. Mandoiu
Estimation of alternative splicing isoform frequencies from RNA-Seq data. Algorithms Mol. Biol. 6: 9 (2011) - [c4]Marius Nicolae, Ion I. Mandoiu:
Poster: Empirical comparison of protocols for sequencing-based gene and isoform expression profiling. ICCABS 2011: 256 - [c3]Marius Nicolae, Ion I. Mandoiu
Accurate Estimation of Gene Expression Levels from DGE Sequencing Data. ISBRA 2011: 392-403 - [c2]Serghei Mangul, Irina Astrovskaya, Marius Nicolae, Bassam Tork, Ion I. Mandoiu
Maximum Likelihood Estimation of Incomplete Genomic Spectrum from HTS Data. WABI 2011: 213-224 - 2010
- [c1]Marius Nicolae, Serghei Mangul, Ion I. Mandoiu
Estimation of Alternative Splicing isoform Frequencies from RNA-Seq Data. WABI 2010: 202-214 - [i1]Marius Nicolae, Serghei Mangul, Ion I. Mandoiu, Alex Zelikovsky:
Estimation of alternative splicing isoform frequencies from RNA-Seq data. Structure Discovery in Biology: Motifs, Networks & Phylogenies 2010
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-04-25 05:48 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: