default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRune B. Lyngsø
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j13]Anastasia Ignatieva
, Rune B. Lyngsø, Paul A. Jenkins, Jotun Hein:
KwARG: parsimonious reconstruction of ancestral recombination graphs with recurrent mutation. Bioinform. 37(19): 3277-3284 (2021)
2010 – 2019
- 2016
- [r6]Rune B. Lyngsø:
RNA Secondary Structure Boltzmann Distribution. Encyclopedia of Algorithms 2016: 1842-1846 - [r5]Rune B. Lyngsø:
RNA Secondary Structure Prediction by Minimum Free Energy. Encyclopedia of Algorithms 2016: 1846-1850 - [r4]Rune B. Lyngsø:
RNA Secondary Structure Prediction Including Pseudoknots. Encyclopedia of Algorithms 2016: 1850-1853 - 2015
- [j12]Joseph L. Herman, Ádám Novák, Rune B. Lyngsø, Adrienn Szabó, István Miklós, Jotun Hein:
Efficient representation of uncertainty in multiple sequence alignments using directed acyclic graphs. BMC Bioinform. 16: 108:1-108:26 (2015) - 2013
- [j11]James W. J. Anderson, Pierre A. Haas, Leigh-Anne Mathieson, Vladimir Volynkin, Rune B. Lyngsø, Paula Tataru, Jotun Hein:
Oxfold: kinetic folding of RNA using stochastic context-free grammars and evolutionary information. Bioinform. 29(6): 704-710 (2013) - 2012
- [j10]James W. J. Anderson, Paula Tataru, Joe Staines, Jotun Hein, Rune B. Lyngsø:
Evolving stochastic context-free grammars for RNA secondary structure prediction. BMC Bioinform. 13: 78 (2012) - [j9]Rune B. Lyngsø, James W. J. Anderson, Elena Sizikova, Amarendra Badugu, Tomas Hyland, Jotun Hein:
Frnakenstein: multiple target inverse RNA folding. BMC Bioinform. 13: 260 (2012) - [c13]Luke Cartey, Rune B. Lyngsø, Oege de Moor:
Synthesising graphics card programs from DSLs. PLDI 2012: 121-132 - 2010
- [j8]Márton Münz, Rune B. Lyngsø, Jotun Hein, Philip C. Biggin:
Dynamics based alignment of proteins: an alternative approach to quantify dynamic similarity. BMC Bioinform. 11: 188 (2010)
2000 – 2009
- 2008
- [j7]Ádám Novák, István Miklós, Rune B. Lyngsø, Jotun Hein:
StatAlign: an extendable software package for joint Bayesian estimation of alignments and evolutionary trees. Bioinform. 24(20): 2403-2404 (2008) - [c12]Rune B. Lyngsø, Yun S. Song, Jotun Hein:
Accurate Computation of Likelihoods in the Coalescent with Recombination Via Parsimony. RECOMB 2008: 463-477 - [r3]Rune B. Lyngsø:
RNA Secondary Structure Boltzmann Distribution. Encyclopedia of Algorithms 2008 - [r2]Rune B. Lyngsø:
RNA Secondary Structure Prediction by Minimum Free Energy. Encyclopedia of Algorithms 2008 - [r1]Rune B. Lyngsø:
RNA Secondary Structure Prediction Including Pseudoknots. Encyclopedia of Algorithms 2008 - 2006
- [j6]Yun S. Song, Rune B. Lyngsø, Jotun Hein:
Counting All Possible Ancestral Configurations of Sample Sequences in Population Genetics. IEEE ACM Trans. Comput. Biol. Bioinform. 3(3): 239-251 (2006) - [c11]Paul A. Jenkins, Rune B. Lyngsø, Jotun Hein:
How Many Transcripts Does It Take to Reconstruct the Splice Graph? WABI 2006: 103-114 - 2005
- [j5]Jakob Hull Havgaard, Rune B. Lyngsø, Gary D. Stormo, Jan Gorodkin:
Pairwise local structural alignment of RNA sequences with sequence similarity less than 40%. Bioinform. 21(9): 1815-1824 (2005) - [j4]Jakob Hull Havgaard, Rune B. Lyngsø, Jan Gorodkin:
The FOLDALIGN web server for pairwise structural RNA alignment and mutual motif search. Nucleic Acids Res. 33(Web-Server-Issue): 650-653 (2005) - [c10]Rune B. Lyngsø, Yun S. Song, Jotun Hein:
Minimum Recombination Histories by Branch and Bound. WABI 2005: 239-250 - 2004
- [c9]Rune B. Lyngsø:
Complexity of Pseudoknot Prediction in Simple Models. ICALP 2004: 919-931 - 2002
- [j3]Rune B. Lyngsø, Christian N. S. Pedersen:
The consensus string problem and the complexity of comparing hidden Markov models. J. Comput. Syst. Sci. 65(3): 545-569 (2002) - [c8]Gerth Stølting Brodal, Rune B. Lyngsø, Anna Östlin, Christian N. S. Pedersen:
Solving the String Statistics Problem in Time O(n log n). ICALP 2002: 728-739 - 2001
- [c7]Rune B. Lyngsø, Christian N. S. Pedersen:
Complexity of Comparing Hidden Markov Models. ISAAC 2001: 416-428 - [c6]Arun K. Jagota, Rune B. Lyngsø, Christian N. S. Pedersen:
Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar. WABI 2001: 69-94 - 2000
- [j2]Rune B. Lyngsø, Christian N. S. Pedersen:
RNA Pseudoknot Prediction in Energy-Based Models. J. Comput. Biol. 7(3-4): 409-427 (2000) - [c5]Rune B. Lyngsø, Christian N. S. Pedersen:
Pseudoknots in RNA secondary structures. RECOMB 2000: 201-209
1990 – 1999
- 1999
- [j1]Rune B. Lyngsø, Michael Zuker, Christian N. S. Pedersen:
Fast evaluation of internal loops in RNA secondary structure prediction. Bioinform. 15(6): 440-445 (1999) - [c4]Gerth Stølting Brodal, Rune B. Lyngsø, Christian N. S. Pedersen, Jens Stoye:
Finding Maximal Pairs with Bounded Gap. CPM 1999: 134-149 - [c3]Rune B. Lyngsø, Christian N. S. Pedersen, Henrik Nielsen:
Metrics and Similarity Measures for Hidden Markov Models. ISMB 1999: 178-186 - [c2]Rune B. Lyngsø, Michael Zuker, Christian N. S. Pedersen:
Internal loops in RNA secondary structure prediction. RECOMB 1999: 260-267 - 1998
- [c1]Christian N. S. Pedersen, Rune B. Lyngsø, Jotun Hein:
Comparison of Coding DNA. CPM 1998: 153-173
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:44 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:
