GASH: An improved algorithm for maximizing the number of equivalent residues between two protein structures
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1471-2105
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
GASH: An improved algorithm for maximizing the number of equivalent residues between two protein structures ; volume:6 ; number:1 ; day:08 ; month:9 ; year:2005 ; pages:1-19 ; date:12.2005
BMC bioinformatics ; 6, Heft 1 (08.9.2005), 1-19, 12.2005
- Creator
-
Standley, Daron M.
- Contributor
-
Toh, Hiroyuki
Nakamura, Haruki
SpringerLink (Online service)
- DOI
-
10.1186/1471-2105-6-221
- URN
-
urn:nbn:de:1111-2016021617665
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:30 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Standley, Daron M.
- Toh, Hiroyuki
- Nakamura, Haruki
- SpringerLink (Online service)
Other Objects (12)
Exploring publication networks with a local cohesion-maximizing algorithm
Maximizing mushroom residues benefits to produce vermicompost for Fusarium Oxysporium resistance in maize
A stable model for maximizing the number of significant features
Correction: Maximizing mushroom residues benefits to produce vermicompost for Fusarium Oxysporium resistance in maize
On coverings and reduced residues in combinatorial number theory
Sponsored Search Auction and the Revenue- Maximizing Number of Ads per Page
Maximizing the fault coverage in complex circuits by minimal number of signatures
Routing Algorithm for Maximizing Lifetime of Wireless Sensor Network for Broadcast Transmission
Mirror-image-based disjoint multi-paths routing algorithm for maximizing communication efficiency
An Energy Efficient Clustering Algorithm for Maximizing the Lifetime of Wireless Sensor Network
Asymptotic equivalent analysis of the LMS algorithm under linearly filtered processes
Value‐maximizing football clubs
Exploring publication networks with a local cohesion-maximizing algorithm
Maximizing mushroom residues benefits to produce vermicompost for Fusarium Oxysporium resistance in maize
A stable model for maximizing the number of significant features
Correction: Maximizing mushroom residues benefits to produce vermicompost for Fusarium Oxysporium resistance in maize
On coverings and reduced residues in combinatorial number theory
Sponsored Search Auction and the Revenue- Maximizing Number of Ads per Page
Maximizing the fault coverage in complex circuits by minimal number of signatures
Routing Algorithm for Maximizing Lifetime of Wireless Sensor Network for Broadcast Transmission
Mirror-image-based disjoint multi-paths routing algorithm for maximizing communication efficiency
An Energy Efficient Clustering Algorithm for Maximizing the Lifetime of Wireless Sensor Network
Asymptotic equivalent analysis of the LMS algorithm under linearly filtered processes
Value‐maximizing football clubs
Exploring publication networks with a local cohesion-maximizing algorithm
Maximizing mushroom residues benefits to produce vermicompost for Fusarium Oxysporium resistance in maize
A stable model for maximizing the number of significant features
Correction: Maximizing mushroom residues benefits to produce vermicompost for Fusarium Oxysporium resistance in maize
On coverings and reduced residues in combinatorial number theory
Sponsored Search Auction and the Revenue- Maximizing Number of Ads per Page
Maximizing the fault coverage in complex circuits by minimal number of signatures
Routing Algorithm for Maximizing Lifetime of Wireless Sensor Network for Broadcast Transmission
Mirror-image-based disjoint multi-paths routing algorithm for maximizing communication efficiency
An Energy Efficient Clustering Algorithm for Maximizing the Lifetime of Wireless Sensor Network
Asymptotic equivalent analysis of the LMS algorithm under linearly filtered processes