A Block Recursive Algorithm for Sequence Alignment

Based on a new way to compute check points, this paper presents a "Block Recursive" sequence alignment algorithm, which can run in a time requirement between 1.5 mn and 3 mn in general cases but between 1.5 mn and 2 mn for sequences with high similarities. Still, the algorithm keeps a line...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2008 2nd International Conference on Bioinformatics and Biomedical Engineering Ročník 2; s. 604 - 607
Hlavní autori: Wang, Fang-Yuan, Li, Yu-Jian
Médium: Konferenčný príspevok.. Journal Article
Jazyk:English
Vydavateľské údaje: IEEE 2008
Predmet:
Computer science
Iterative algorithms
ISBN:9781424417476, 1424417473
ISSN:2151-7614
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Based on a new way to compute check points, this paper presents a "Block Recursive" sequence alignment algorithm, which can run in a time requirement between 1.5 mn and 3 mn in general cases but between 1.5 mn and 2 mn for sequences with high similarities. Still, the algorithm keeps a linear space requirement and always guarantees an optimal alignment result. Some experiments show that it runs at least 10% faster than the Hirschberg algorithm if the two compared sequences has a normalized edit distance less than 0.25.
AbstractList Based on a new way to compute check points, this paper presents a "Block Recursive" sequence alignment algorithm, which can run in a time requirement between 1.5 mn and 3 mn in general cases but between 1.5 mn and 2 mn for sequences with high similarities. Still, the algorithm keeps a linear space requirement and always guarantees an optimal alignment result. Some experiments show that it runs at least 10% faster than the Hirschberg algorithm if the two compared sequences has a normalized edit distance less than 0.25.
Based on a new way to compute check points, this paper presents a "Block Recursive" sequence alignment algorithm, which can run in a time requirement between 1.5 mn and 3 mn in general cases but between 1.5 mn and 2 mn for sequences with [abstract truncated by publisher].
Author Wang, Fang-Yuan
Li, Yu-Jian
Author_xml – sequence: 1
  givenname: Fang-Yuan
  surname: Wang
  fullname: Wang, Fang-Yuan
  email: fainter1945@emails.bjut.edu.cn
  organization: Coll. of Comput. Sci. & Technol., Beijing Univ. of Technol., Beijing
– sequence: 2
  givenname: Yu-Jian
  surname: Li
  fullname: Li, Yu-Jian
  email: liyujian@mails.bjut.edu.cn
  organization: Coll. of Comput. Sci. & Technol., Beijing Univ. of Technol., Beijing
BookMark eNo1jr1PwzAUxI1oJdrSlYUlE1uKn-PYfmNbFahUCYmPOUrc52LIR4kTJP57ggrT6U6_O92UjeqmJsaugC8AON5u16vVZiE4NwuQ-oxNQQopQUsD52yO2vx7rUZsIiCFWCuQYzYdOhq5Qo4XbB7CO-cchgRRT5hYRquysR_RE9m-Df6LomV5aFrfvVWRa9romT57qu1v7A91RXV3ycYuLwPN_3TGXu82L-uHePd4v10vd7EHAV1cKCsxKYrCOSXBGqf3Ru6J3HDQIbcGcS-BTJ5QIa0sFCYKFDqrMMfcuGTGbk67x7YZPoQuq3ywVJZ5TU0fMsFTSCVPB_D6BHoiyo6tr_L2O5NpknKhkx-4-Vfh
ContentType Conference Proceeding
Journal Article
DBID 6IE
6IL
CBEJK
RIE
RIL
7QO
8FD
FR3
P64
DOI 10.1109/ICBBE.2008.147
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
Biotechnology Research Abstracts
Technology Research Database
Engineering Research Database
Biotechnology and BioEngineering Abstracts
DatabaseTitle Engineering Research Database
Biotechnology Research Abstracts
Technology Research Database
Biotechnology and BioEngineering Abstracts
DatabaseTitleList
Engineering Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Biology
Computer Science
EISBN 1424417481
9781424417483
EndPage 607
ExternalDocumentID 4535027
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AAWTH
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
M43
OCL
RIE
RIL
RNS
7QO
8FD
AARBI
FR3
IERZE
P64
ID FETCH-LOGICAL-i121t-b6c493bbbff641c8f7d84deef476f90c899d41e8a3eb4c4b6936169fc69a9a8f3
IEDL.DBID RIE
ISBN 9781424417476
1424417473
ISSN 2151-7614
IngestDate Tue Oct 07 08:29:59 EDT 2025
Wed Aug 27 02:42:28 EDT 2025
IsPeerReviewed false
IsScholarly false
LCCN 2007906909
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i121t-b6c493bbbff641c8f7d84deef476f90c899d41e8a3eb4c4b6936169fc69a9a8f3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
PQID 20515405
PQPubID 23462
PageCount 4
ParticipantIDs ieee_primary_4535027
proquest_miscellaneous_20515405
PublicationCentury 2000
PublicationDate 2008-00-00
PublicationDateYYYYMMDD 2008-01-01
PublicationDate_xml – year: 2008
  text: 2008-00-00
PublicationDecade 2000
PublicationTitle 2008 2nd International Conference on Bioinformatics and Biomedical Engineering
PublicationTitleAbbrev ICBBE
PublicationYear 2008
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001079997
ssj0000453933
Score 1.3908784
Snippet Based on a new way to compute check points, this paper presents a "Block Recursive" sequence alignment algorithm, which can run in a time requirement between...
SourceID proquest
ieee
SourceType Aggregation Database
Publisher
StartPage 604
SubjectTerms Computer science
Iterative algorithms
Title A Block Recursive Algorithm for Sequence Alignment
URI https://ieeexplore.ieee.org/document/4535027
https://www.proquest.com/docview/20515405
Volume 2
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4A0cQTChjxuQePrlBa2u0RCEQvhPhIuJE-pkhUMDxM_Pe2uwse9OJtd5Mmm8m08830m_kAri1VVrWFiBV1GDNrXayd3-4ojLA-C3Jtk6RiE2I4TMZjOSrAza4XBhFT8hnehsf0Lt8uzCaUyhqsTds-jSpCUQie9Wrt6ikemlCZQ5e0vtIUHvuEbukQ1GKfrbNtX5cH4YJuxz3l7zwf6EiasnHf63b7Gc2S7GRXfp3VaQAalP_364dQ--nki0a7GHUEBZxXYD8ToPyqQHkr6hDle7wKrU7U9QHuNXoIlfhAbo86b9PFcrZ-eY88wo0ec_K1_zybplyCGjwP-k-9uzgXVohnpEXWseaGSaq1do4zYhInbMIsovN2cLJpfA5mGcFEUdTMMM0l5YRLZ7hUUiWOHkNpvpjjCUTaCaLQnwIUDaOsqYTiaIjV0irr_aMO1WCMyUc2O2OS26EOV1trTrw_h0sKNcfFZjVpBdEZjyJP_154BgcZYyMUQc6htF5u8AL2zOd6tlpepi7xDVtrsPI
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLZggODEW4xnDxwpa5a0aY4MbQIB08RD4lbl4YwJ2NDWIfHvSdpuHODCra0UqbKc-LPz2R_AqaHSyJjzUFKLITPGhsq67Y5cc-OyIBvrtBCb4N1u-vwsegtwNu-FQcSCfIbn_rG4yzcjPfWlsgaLaezSqEVYihlrRmW31ryi4sAJFRV4KSosEXfox_dL-7AWunydzTq7HAzndDbwqXpPqpGOJBKN68tWq10SLclceOXXaV2EoM76_35-A3Z-evmC3jxKbcICDrdgpZSg_NqC9ZmsQ1Dt8m1oXgQtF-Jeg3tfi_f09uDirT8aD_KX98Bh3OChol-7z4N-wSbYgadO-_HyKqykFcIBaZI8VIlmgiqlrE0Y0anlJmUG0To7WBFpl4UZRjCVFBXTTCWCJiQRVidCCplaugu14WiIexAoy4lEdw5Q1IyySHKZoCZGCSON85A6bHtjZB_l9IysskMdTmbWzJxH-2sKOcTRdJI1veyMw5H7fy88gdWrx7vb7Pa6e3MAayV_w5dEDqGWj6d4BMv6Mx9MxseFe3wDxF20OQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2008+2nd+International+Conference+on+Bioinformatics+and+Biomedical+Engineering&rft.atitle=A+Block+Recursive+Algorithm+for+Sequence+Alignment&rft.au=Wang%2C+Fang-Yuan&rft.au=Li%2C+Yu-Jian&rft.date=2008-01-01&rft.pub=IEEE&rft.isbn=9781424417476&rft.issn=2151-7614&rft.spage=604&rft.epage=607&rft_id=info:doi/10.1109%2FICBBE.2008.147&rft.externalDocID=4535027
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2151-7614&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2151-7614&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2151-7614&client=summon