Protein Structure Prediction Using Parallel Linkage Investigating Genetic Algorithms

0 avg rating
( 0 ratings by Goodreads )
 
9781288228386: Protein Structure Prediction Using Parallel Linkage Investigating Genetic Algorithms
View all copies of this ISBN edition:
 
 

The tertiary structure determines the protein's functionality. Genetic algorithms (GAs) are stochastic search routines that are capable of providing solutions to intractable problems. The use of GAs plays an important part in the search for near optimal solutions in large search spaces. The PSP solution landscape is so large and complex that deterministic methods flounder due to the combinatoric issues involved with enumerating these massive search spaces. This makes the GA an ideal candidate for finding solutions to the PSP problem. This is an engineering investigation into the effectiveness and efficiency of the Linkage Learning GA (LLGA) applied to the PSP problem. The LLGA implementations takes explicit advantage of "tight linkages" early enough in its algorithmic processing to overcome the disruptive effects of crossover. The LLGA is integrated with the previously developed and tested AFIT CHARMm energy model software. Furthermore, a parallel version, pLLGA, is developed using a data partitioning scheme to "farm out" the CHARMm evaluations. Portability across AFIT's heterogeneous ABC Beowulf system, distributed networks, and massively parallel platforms is accomplished through the use of object-oriented C++ and the Message Passing Interface (MPI). This model improves the efficiency of the LLGA algorithm. Ramachandran developed constraints are incorporated into the LLGA to exploit domain knowledge in order to improve the effectiveness of the search technique. This approach, constrained-LLGA (cLLGA), has been parallelized using the same decomposition as the pLLGA. This new implementation is called the constrained-parallel LLGA (cpLLGA).

"synopsis" may belong to another edition of this title.

Buy New View Book
List Price: US$ 49.00
US$ 32.73

Convert Currency

Shipping: US$ 3.52
From Germany to U.S.A.

Destination, Rates & Speeds

Add to Basket

Top Search Results from the AbeBooks Marketplace

1.

Karl R. Deerman
Published by BiblioScholar (2012)
ISBN 10: 1288228384 ISBN 13: 9781288228386
New Softcover Quantity Available: 15
Print on Demand
Seller:
Rating
[?]

Book Description BiblioScholar, 2012. Condition: New. This item is printed on demand for shipment within 3 working days. Seller Inventory # LP9781288228386

More information about this seller | Contact this seller

Buy New
US$ 32.73
Convert Currency

Add to Basket

Shipping: US$ 3.52
From Germany to U.S.A.
Destination, Rates & Speeds

2.

Karl R Deerman
Published by Biblioscholar, United States (2012)
ISBN 10: 1288228384 ISBN 13: 9781288228386
New Paperback Quantity Available: 10
Seller:
Book Depository hard to find
(London, United Kingdom)
Rating
[?]

Book Description Biblioscholar, United States, 2012. Paperback. Condition: New. Language: English . This book usually ship within 10-15 business days and we will endeavor to dispatch orders quicker than this where possible. Brand New Book. The tertiary structure determines the protein s functionality. Genetic algorithms (GAs) are stochastic search routines that are capable of providing solutions to intractable problems. The use of GAs plays an important part in the search for near optimal solutions in large search spaces. The PSP solution landscape is so large and complex that deterministic methods flounder due to the combinatoric issues involved with enumerating these massive search spaces. This makes the GA an ideal candidate for finding solutions to the PSP problem. This is an engineering investigation into the effectiveness and efficiency of the Linkage Learning GA (LLGA) applied to the PSP problem. The LLGA implementations takes explicit advantage of tight linkages early enough in its algorithmic processing to overcome the disruptive effects of crossover. The LLGA is integrated with the previously developed and tested AFIT CHARMm energy model software. Furthermore, a parallel version, pLLGA, is developed using a data partitioning scheme to farm out the CHARMm evaluations. Portability across AFIT s heterogeneous ABC Beowulf system, distributed networks, and massively parallel platforms is accomplished through the use of object-oriented C++ and the Message Passing Interface (MPI). This model improves the efficiency of the LLGA algorithm. Ramachandran developed constraints are incorporated into the LLGA to exploit domain knowledge in order to improve the effectiveness of the search technique. This approach, constrained-LLGA (cLLGA), has been parallelized using the same decomposition as the pLLGA. This new implementation is called the constrained-parallel LLGA (cpLLGA). Seller Inventory # LIE9781288228386

More information about this seller | Contact this seller

Buy New
US$ 37.25
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

3.

Karl R Deerman
Published by Biblioscholar, United States (2012)
ISBN 10: 1288228384 ISBN 13: 9781288228386
New Paperback Quantity Available: 10
Print on Demand
Seller:
Book Depository International
(London, United Kingdom)
Rating
[?]

Book Description Biblioscholar, United States, 2012. Paperback. Condition: New. Language: English . Brand New Book ***** Print on Demand *****. The tertiary structure determines the protein s functionality. Genetic algorithms (GAs) are stochastic search routines that are capable of providing solutions to intractable problems. The use of GAs plays an important part in the search for near optimal solutions in large search spaces. The PSP solution landscape is so large and complex that deterministic methods flounder due to the combinatoric issues involved with enumerating these massive search spaces. This makes the GA an ideal candidate for finding solutions to the PSP problem. This is an engineering investigation into the effectiveness and efficiency of the Linkage Learning GA (LLGA) applied to the PSP problem. The LLGA implementations takes explicit advantage of tight linkages early enough in its algorithmic processing to overcome the disruptive effects of crossover. The LLGA is integrated with the previously developed and tested AFIT CHARMm energy model software. Furthermore, a parallel version, pLLGA, is developed using a data partitioning scheme to farm out the CHARMm evaluations. Portability across AFIT s heterogeneous ABC Beowulf system, distributed networks, and massively parallel platforms is accomplished through the use of object-oriented C++ and the Message Passing Interface (MPI). This model improves the efficiency of the LLGA algorithm. Ramachandran developed constraints are incorporated into the LLGA to exploit domain knowledge in order to improve the effectiveness of the search technique. This approach, constrained-LLGA (cLLGA), has been parallelized using the same decomposition as the pLLGA. This new implementation is called the constrained-parallel LLGA (cpLLGA). Seller Inventory # AAV9781288228386

More information about this seller | Contact this seller

Buy New
US$ 60.21
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

4.

Karl R Deerman
Published by Biblioscholar, United States (2012)
ISBN 10: 1288228384 ISBN 13: 9781288228386
New Paperback Quantity Available: 10
Print on Demand
Seller:
The Book Depository
(London, United Kingdom)
Rating
[?]

Book Description Biblioscholar, United States, 2012. Paperback. Condition: New. Language: English . Brand New Book ***** Print on Demand *****.The tertiary structure determines the protein s functionality. Genetic algorithms (GAs) are stochastic search routines that are capable of providing solutions to intractable problems. The use of GAs plays an important part in the search for near optimal solutions in large search spaces. The PSP solution landscape is so large and complex that deterministic methods flounder due to the combinatoric issues involved with enumerating these massive search spaces. This makes the GA an ideal candidate for finding solutions to the PSP problem. This is an engineering investigation into the effectiveness and efficiency of the Linkage Learning GA (LLGA) applied to the PSP problem. The LLGA implementations takes explicit advantage of tight linkages early enough in its algorithmic processing to overcome the disruptive effects of crossover. The LLGA is integrated with the previously developed and tested AFIT CHARMm energy model software. Furthermore, a parallel version, pLLGA, is developed using a data partitioning scheme to farm out the CHARMm evaluations. Portability across AFIT s heterogeneous ABC Beowulf system, distributed networks, and massively parallel platforms is accomplished through the use of object-oriented C++ and the Message Passing Interface (MPI). This model improves the efficiency of the LLGA algorithm. Ramachandran developed constraints are incorporated into the LLGA to exploit domain knowledge in order to improve the effectiveness of the search technique. This approach, constrained-LLGA (cLLGA), has been parallelized using the same decomposition as the pLLGA. This new implementation is called the constrained-parallel LLGA (cpLLGA). Seller Inventory # AAV9781288228386

More information about this seller | Contact this seller

Buy New
US$ 61.93
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

5.

Deerman, Karl R.
Published by Biblioscholar (2012)
ISBN 10: 1288228384 ISBN 13: 9781288228386
New Quantity Available: > 20
Print on Demand
Seller:
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description Biblioscholar, 2012. PAP. Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9781288228386

More information about this seller | Contact this seller

Buy New
US$ 59.26
Convert Currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, Rates & Speeds

6.

Karl R Deerman
Published by Biblioscholar (2012)
ISBN 10: 1288228384 ISBN 13: 9781288228386
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description Biblioscholar, 2012. PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9781288228386

More information about this seller | Contact this seller

Buy New
US$ 51.43
Convert Currency

Add to Basket

Shipping: US$ 12.12
From United Kingdom to U.S.A.
Destination, Rates & Speeds

7.

Deerman, Karl R.
Published by BiblioScholar (2016)
ISBN 10: 1288228384 ISBN 13: 9781288228386
New Paperback Quantity Available: 1
Print on Demand
Seller:
Ria Christie Collections
(Uxbridge, United Kingdom)
Rating
[?]

Book Description BiblioScholar, 2016. Paperback. Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Seller Inventory # ria9781288228386_lsuk

More information about this seller | Contact this seller

Buy New
US$ 60.93
Convert Currency

Add to Basket

Shipping: US$ 5.20
From United Kingdom to U.S.A.
Destination, Rates & Speeds

8.

Karl R. Deerman
Published by BiblioScholar
ISBN 10: 1288228384 ISBN 13: 9781288228386
New Paperback Quantity Available: > 20
Seller:
BuySomeBooks
(Las Vegas, NV, U.S.A.)
Rating
[?]

Book Description BiblioScholar. Paperback. Condition: New. 214 pages. Dimensions: 9.7in. x 7.4in. x 0.5in.The tertiary structure determines the proteins functionality. Genetic algorithms (GAs) are stochastic search routines that are capable of providing solutions to intractable problems. The use of GAs plays an important part in the search for near optimal solutions in large search spaces. The PSP solution landscape is so large and complex that deterministic methods flounder due to the combinatoric issues involved with enumerating these massive search spaces. This makes the GA an ideal candidate for finding solutions to the PSP problem. This is an engineering investigation into the effectiveness and efficiency of the Linkage Learning GA (LLGA) applied to the PSP problem. The LLGA implementations takes explicit advantage of tight linkages early enough in its algorithmic processing to overcome the disruptive effects of crossover. The LLGA is integrated with the previously developed and tested AFIT CHARMm energy model software. Furthermore, a parallel version, pLLGA, is developed using a data partitioning scheme to farm out the CHARMm evaluations. Portability across AFITs heterogeneous ABC Beowulf system, distributed networks, and massively parallel platforms is accomplished through the use of object-oriented C and the Message Passing Interface (MPI). This model improves the efficiency of the LLGA algorithm. Ramachandran developed constraints are incorporated into the LLGA to exploit domain knowledge in order to improve the effectiveness of the search technique. This approach, constrained-LLGA (cLLGA), has been parallelized using the same decomposition as the pLLGA. This new implementation is called the constrained-parallel LLGA (cpLLGA). This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Paperback. Seller Inventory # 9781288228386

More information about this seller | Contact this seller

Buy New
US$ 71.96
Convert Currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds