default search action
Remco Loos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j14]Mehrdad Oveisi
, Manu Shukla, Nogayhan Seymen
iNucs: inter-nucleosome interactions. Bioinform. 37(23): 4562-4563 (2021)
2010 – 2019
- 2019
- [j13]Francisco J. Campos-Laborie
DECO: decompose heterogeneous population cohorts for patient stratification and discovery of sample biomarkers using omic data profiling. Bioinform. 35(19): 3651-3662 (2019) - 2013
- [j12]Nathan S. Watson-Haigh
Next-generation sequencing: a challenge to meet the increasing demand for training workshops in Australia. Briefings Bioinform. 14(5): 563-574 (2013) - 2010
- [j11]Remco Loos
Small universal accepting hybrid networks of evolutionary processors. Acta Informatica 47(2): 133-146 (2010) - [j10]Remco Loos, Florin Manea, Victor Mitrana:
Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections. J. Autom. Lang. Comb. 15(1/2): 155-174 (2010) - [j9]Remco Loos
Time and Space Complexity for Splicing Systems. Theory Comput. Syst. 47(2): 301-316 (2010)
2000 – 2009
- 2009
- [j8]Remco Loos
On small, reduced, and fast universal accepting networks of splicing processors. Theor. Comput. Sci. 410(4-5): 406-416 (2009) - [c6]Paola Bonizzoni
Finite Splicing: Generative Capacity, New Models and Complexity Aspects. Algorithmic Bioprocesses 2009: 313-329 - [c5]Remco Loos
Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections. DCFS 2009: 173-182 - 2008
- [b1]Remco Loos:
Finite Models of Splicing and Their Complexity. University of Rovira i Virgili, Spain, 2008 - [j7]Tseren-Onolt Ishdorj, Remco Loos, Ion Petre:
Computational Efficiency of Intermolecular Gene Assembly. Fundam. Informaticae 84(3-4): 363-373 (2008) - [j6]Remco Loos
1st International Conference on Language and Automata Theory and Applications (LATA 2007). Inf. Comput. 206(9-10): 1017 (2008) - [j5]Remco Loos
Descriptional Complexity of Splicing Systems. Int. J. Found. Comput. Sci. 19(4): 813-826 (2008) - 2007
- [j4]Remco Loos
Non-preserving splicing with delay. Int. J. Comput. Math. 84(4): 427-436 (2007) - [j3]Remco Loos
Complexity theory for splicing systems. Theor. Comput. Sci. 386(1-2): 132-150 (2007) - [c4]Remco Loos
On Accepting Networks of Splicing Processors of Size 3. CiE 2007: 497-506 - [c3]Remco Loos, Andreas Malcher, Detlef Wotschke:
Descriptional Complexity of Splicing Systems. DCFS 2007: 93-104 - [c2]Remco Loos
Complexity Theory for Splicing Systems. Developments in Language Theory 2007: 300-311 - [e1]Remco Loos, Szilárd Zsolt Fazekas, Carlos Martín-Vide:
LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona 2007 [contents] - 2006
- [j2]Remco Loos:
Time-varying H Systems Revisited. J. Univers. Comput. Sci. 12(10): 1455-1463 (2006) - [j1]Remco Loos
An alternative definition of splicing. Theor. Comput. Sci. 358(1): 75-87 (2006) - [c1]Remco Loos
Solving SAT and HPP with Accepting Splicing Systems. PPSN 2006: 771-777
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-07 21:20 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: