Neutral networks

Christian Reidys ()
Additional contact information
Christian Reidys: Nankai University, Research Center for Combinatorics

Chapter 7 in Combinatorial Computational Biology of RNA, 2011, pp 213-243 from Springer

Abstract: Abstract In this chapter we study the structure of neutral networks neutral network as induced subgraphs of sequence space sequence! space . Since exhaustive computation of sequence to structure maps using folding algorithms is at present time only feasible for sequences of length $${

Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-76731-4_7

Ordering information: This item can be ordered from
http://www.springer.com/9780387767314

DOI: 10.1007/978-0-387-76731-4_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().