Multiple sequence alignment by parallel simulated annealing:
Abstract: "We have applied simulated annealing algorithms to solve problems of multiple alignment. A temperature parallel algorithm, a simple parallel algorithm and a sequential algorithm were tested on a problem. The results were compared with the result obtained by the conventional tree-based...
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1992
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
730 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We have applied simulated annealing algorithms to solve problems of multiple alignment. A temperature parallel algorithm, a simple parallel algorithm and a sequential algorithm were tested on a problem. The results were compared with the result obtained by the conventional tree-based method. As a result, every annealing algorithm has produced a better energy than the tree-based method. Particularly, either of the parallel annealing algorithm has reached the best energy, probably the optimal solution. We consider the temperature parallel algorithm of simulated annealing to be the most suitable for finding the optimal multiple alignment, because the algorithm does not require any re- scheduling for further optimization The algorithm is also suitable for refinement of a multiple alignment obtained by other heuristic methods. |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010956210 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960918s1992 |||| 00||| engod | ||
| 035 | |a (OCoLC)26726547 | ||
| 035 | |a (DE-599)BVBBV010956210 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 245 | 1 | 0 | |a Multiple sequence alignment by parallel simulated annealing |c by M. Ishikawa ... |
| 264 | 1 | |a Tokyo, Japan |c 1992 | |
| 300 | |a 12 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 730 | |
| 520 | 3 | |a Abstract: "We have applied simulated annealing algorithms to solve problems of multiple alignment. A temperature parallel algorithm, a simple parallel algorithm and a sequential algorithm were tested on a problem. The results were compared with the result obtained by the conventional tree-based method. As a result, every annealing algorithm has produced a better energy than the tree-based method. Particularly, either of the parallel annealing algorithm has reached the best energy, probably the optimal solution. We consider the temperature parallel algorithm of simulated annealing to be the most suitable for finding the optimal multiple alignment, because the algorithm does not require any re- scheduling for further optimization | |
| 520 | 3 | |a The algorithm is also suitable for refinement of a multiple alignment obtained by other heuristic methods. | |
| 650 | 4 | |a Simulated annealing (Mathematics) | |
| 700 | 1 | |a Ishikawa, Masato |e Sonstige |4 oth | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 730 |w (DE-604)BV010923438 |9 730 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007328375 | ||
Datensatz im Suchindex
| _version_ | 1804125443415080960 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV010956210 |
| ctrlnum | (OCoLC)26726547 (DE-599)BVBBV010956210 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01809nam a2200301 cb4500</leader><controlfield tag="001">BV010956210</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960918s1992 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26726547</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010956210</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Multiple sequence alignment by parallel simulated annealing</subfield><subfield code="c">by M. Ishikawa ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">730</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We have applied simulated annealing algorithms to solve problems of multiple alignment. A temperature parallel algorithm, a simple parallel algorithm and a sequential algorithm were tested on a problem. The results were compared with the result obtained by the conventional tree-based method. As a result, every annealing algorithm has produced a better energy than the tree-based method. Particularly, either of the parallel annealing algorithm has reached the best energy, probably the optimal solution. We consider the temperature parallel algorithm of simulated annealing to be the most suitable for finding the optimal multiple alignment, because the algorithm does not require any re- scheduling for further optimization</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The algorithm is also suitable for refinement of a multiple alignment obtained by other heuristic methods.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Simulated annealing (Mathematics)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ishikawa, Masato</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">730</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">730</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007328375</subfield></datafield></record></collection> |
| id | DE-604.BV010956210 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:38Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007328375 |
| oclc_num | 26726547 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 12 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spelling | Multiple sequence alignment by parallel simulated annealing by M. Ishikawa ... Tokyo, Japan 1992 12 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 730 Abstract: "We have applied simulated annealing algorithms to solve problems of multiple alignment. A temperature parallel algorithm, a simple parallel algorithm and a sequential algorithm were tested on a problem. The results were compared with the result obtained by the conventional tree-based method. As a result, every annealing algorithm has produced a better energy than the tree-based method. Particularly, either of the parallel annealing algorithm has reached the best energy, probably the optimal solution. We consider the temperature parallel algorithm of simulated annealing to be the most suitable for finding the optimal multiple alignment, because the algorithm does not require any re- scheduling for further optimization The algorithm is also suitable for refinement of a multiple alignment obtained by other heuristic methods. Simulated annealing (Mathematics) Ishikawa, Masato Sonstige oth Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 730 (DE-604)BV010923438 730 |
| spellingShingle | Multiple sequence alignment by parallel simulated annealing Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Simulated annealing (Mathematics) |
| title | Multiple sequence alignment by parallel simulated annealing |
| title_auth | Multiple sequence alignment by parallel simulated annealing |
| title_exact_search | Multiple sequence alignment by parallel simulated annealing |
| title_full | Multiple sequence alignment by parallel simulated annealing by M. Ishikawa ... |
| title_fullStr | Multiple sequence alignment by parallel simulated annealing by M. Ishikawa ... |
| title_full_unstemmed | Multiple sequence alignment by parallel simulated annealing by M. Ishikawa ... |
| title_short | Multiple sequence alignment by parallel simulated annealing |
| title_sort | multiple sequence alignment by parallel simulated annealing |
| topic | Simulated annealing (Mathematics) |
| topic_facet | Simulated annealing (Mathematics) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT ishikawamasato multiplesequencealignmentbyparallelsimulatedannealing |