Rune B. Lyngsø - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2021

KwARG: parsimonious reconstruction of ancestral recombination graphs with recurrent mutationAnastasia Ignatieva, Rune B. Lyngsø, Paul A. Jenkins, Jotun Hein. bioinformatics, 37(19):3277-3284, 2021. [doi]

2015

Efficient representation of uncertainty in multiple sequence alignments using directed acyclic graphsJoseph L. Herman, Ádám Novák, Rune B. Lyngsø, Adrienn Szabó, István Miklós, Jotun Hein. bmcbi, 16:108, 2015. [doi]

2013

Oxfold: kinetic folding of RNA using stochastic context-free grammars and evolutionary informationJames W. J. Anderson, Pierre A. Haas, Leigh-Anne Mathieson, Vladimir Volynkin, Rune B. Lyngsø, Paula Tataru, Jotun Hein. bioinformatics, 29(6):704-710, 2013. [doi]

2012

Evolving stochastic context-free grammars for RNA secondary structure predictionJames W. J. Anderson, Paula Tataru, Joe Staines, Jotun Hein, Rune B. Lyngsø. bmcbi, 13:78, 2012. [doi]

Frnakenstein: multiple target inverse RNA foldingRune B. Lyngsø, James W. J. Anderson, Elena Sizikova, Amarendra Badugu, Tomas Hyland, Jotun Hein. bmcbi, 13:260, 2012. [doi]

2010

Dynamics based alignment of proteins: an alternative approach to quantify dynamic similarityMárton Münz, Rune B. Lyngsø, Jotun Hein, Philip C. Biggin. bmcbi, 11:188, 2010. [doi]

2008

Accurate Computation of Likelihoods in the Coalescent with Recombination Via ParsimonyRune B. Lyngsø, Yun S. Song, Jotun Hein. recomb 2008: 463-477 [doi]

StatAlign: an extendable software package for joint Bayesian estimation of alignments and evolutionary treesÁdám Novák, István Miklós, Rune B. Lyngsø, Jotun Hein. bioinformatics, 24(20):2403-2404, 2008. [doi]

2006

How Many Transcripts Does It Take to Reconstruct the Splice Graph?Paul Jenkins, Rune B. Lyngsø, Jotun Hein. wabi 2006: 103-114 [doi]

Counting All Possible Ancestral Configurations of Sample Sequences in Population GeneticsYun S. Song, Rune B. Lyngsø, Jotun Hein. tcbb, 3(3):239-251, 2006. [doi]

2005

The FOLDALIGN web server for pairwise structural RNA alignment and mutual motif searchJakob Hull Havgaard, Rune B. Lyngsø, Jan Gorodkin. nar, 33(Web-Server-Issue):650-653, 2005. [doi]

Pairwise local structural alignment of RNA sequences with sequence similarity less than 40 Jakob Hull Havgaard, Rune B. Lyngsø, Gary D. Stormo, Jan Gorodkin. bioinformatics, 21(9):1815-1824, 2005. [doi]

Minimum Recombination Histories by Branch and BoundRune B. Lyngsø, Yun S. Song, Jotun Hein. wabi 2005: 239-250 [doi]

2004

Complexity of Pseudoknot Prediction in Simple ModelsRune B. Lyngsø. icalp 2004: 919-931 [doi]

2002

Solving the String Statistics Problem in Time O(n log n)Gerth Stølting Brodal, Rune B. Lyngsø, Anna Östlin, Christian N. S. Pedersen. icalp 2002: 728-739 [doi]

The consensus string problem and the complexity of comparing hidden Markov modelsRune B. Lyngsø, Christian N. S. Pedersen. jcss, 65(3):545-569, 2002. [doi]

2001

Comparing a Hidden Markov Model and a Stochastic Context-Free GrammarArun K. Jagota, Rune B. Lyngsø, Christian N. S. Pedersen. wabi 2001: 69-94 [doi]

Complexity of Comparing Hidden Markov ModelsRune B. Lyngsø, Christian N. S. Pedersen. isaac 2001: 416-428 [doi]

2000

RNA Pseudoknot Prediction in Energy-Based ModelsRune B. Lyngsø, Christian N. S. Pedersen. jcb, 7(3-4):409-427, 2000.

Pseudoknots in RNA secondary structuresRune B. Lyngsø, Christian N. S. Pedersen. recomb 2000: 201-209 [doi]

1999

1998

Comparison of Coding DNAChristian N. S. Pedersen, Rune B. Lyngsø, Jotun Hein. cpm 1998: 153-173

Sign in or sign up to see more results.

runs on WebDSL