{"id":"https://openalex.org/W4413301048","doi":"https://doi.org/10.55819/mrij.2007.2.1.26","title":"A Tool for Pair-Wise Alignment Algorithm","display_name":"A Tool for Pair-Wise Alignment Algorithm","alternate_titles":[],"publication_year":2007,"publication_date":"2007-06-30","ids":{"openalex":"https://openalex.org/W4413301048","doi":"https://doi.org/10.55819/mrij.2007.2.1.26"},"language":"en","primary_location":{"id":"doi:10.55819/mrij.2007.2.1.26","doi":"https://doi.org/10.55819/mrij.2007.2.1.26","is_oa":false,"landing_page_url":"https://doi.org/10.55819/mrij.2007.2.1.26","pdf_url":null,"source":{"id":"https://openalex.org/S4387281766","display_name":"KINFORMS","issn_l":"1975-8480","issn":["1975-8480","2714-1047"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"KINFORMS","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W4413301048"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"KINFORMS","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"KINFORMS","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Allam Appa Rao","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Allam Appa Rao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":"2","issue":"1","first_page":"26","last_page":"42"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.8295999765396118,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.8295999765396118,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.09290000051259995,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12946","display_name":"Fractal and DNA sequence analysis","score":0.06390000134706497,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pairwise-sequence-alignment","display_name":"pairwise sequence alignment","score":0.9290000200271606},{"id":"https://openalex.org/keywords/needleman-wunsch-algorithm","display_name":"Needleman-Wunsch algorithm","score":0.9679999947547913},{"id":"https://openalex.org/keywords/smith-waterman-algorithm","display_name":"Smith-Waterman algorithm","score":0.9980000257492065},{"id":"https://openalex.org/keywords/global-alignment","display_name":"global alignment","score":0.7459999918937683},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.8050000071525574},{"id":"https://openalex.org/keywords/alignment-score","display_name":"alignment score","score":0.7369999885559082},{"id":"https://openalex.org/keywords/gap-penalties","display_name":"gap penalties","score":0.9330000281333923},{"id":"https://openalex.org/keywords/user-interface","display_name":"user interface","score":0.5630000233650208},{"id":"https://openalex.org/keywords/sequence-similarity","display_name":"sequence similarity","score":0.6200000047683716}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5355351567268372},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5028898119926453}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.55819/mrij.2007.2.1.26","doi":"https://doi.org/10.55819/mrij.2007.2.1.26","is_oa":false,"landing_page_url":"https://doi.org/10.55819/mrij.2007.2.1.26","pdf_url":null,"source":{"id":"https://openalex.org/S4387281766","display_name":"KINFORMS","issn_l":"1975-8480","issn":["1975-8480","2714-1047"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"KINFORMS","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2808654017","https://openalex.org/W2144935903","https://openalex.org/W2793417840","https://openalex.org/W2352269109","https://openalex.org/W2504096737","https://openalex.org/W1513175642","https://openalex.org/W2003399735","https://openalex.org/W2384385775","https://openalex.org/W1992408360"],"abstract_inverted_index":{"Bioinformatics":[0],"is":[1,66,86,208],"the":[2,8,48,62,68,113,116,124,139,150,161,174,180,186,194,202,214,217,221,236],"application":[3],"of":[4,12,64,83,115,143,213],"computational":[5],"techniques":[6],"to":[7,46,87,100,137],"management":[9],"and":[10,25,35,56,96,111,159,177,192,201,220],"analysis":[11],"biological":[13],"information.":[14],"The":[15,81,163,183,204,225],"relationship":[16,50,69],"between":[17,51,216],"a":[18,52,57,99,103,169,211,232],"query":[19],"sequence,":[20,28],"commonly":[21],"termed":[22],"as":[23,30,210],"probe":[24],"o":[26],"he":[27],"known":[29,58],"subject":[31],"can":[32,38,43,228],"be":[33,39,44,77,166,229],"quantified":[34],"their":[36],"similarity":[37,42,65],"assessed.":[40],"This":[41],"used":[45],"identify":[47],"evolutionary":[49],"newly":[53],"determined":[54],"sequence":[55],"gene":[59],"family.":[60],"When":[61],"degree":[63],"low,":[67],"must":[70],"remain":[71],"competitive,":[72],"until":[73],"eviden":[74],"e":[75,123],"ha":[76],"ngath":[78],"r":[79,119],"d.":[80],"purpose":[82],"this":[84],"research":[85],"implement":[88],"various":[89],"methods":[90,148],"for":[91,107,172,179,190],"Pair-Wise":[92],"alignment":[93,129,153,206],"t":[94],"chniques":[95],"d":[97],"sign":[98],"l":[101],"with":[102],"good":[104,170],"user":[105,164],"-interface":[106],"aligning":[108],"two":[109,144],"sequences":[110,176,227],"output":[112],"score":[114,207],"alignment.":[117],"Thi":[118],"sea":[120],"h":[121],"u":[122],"va":[125],"iou":[126],"pair":[127],"wis":[128],"algorithms,":[130],"like":[131],"Needleman-Wunsch":[132],"global":[133,152],"alignment,":[134],"Smith-Waterman":[135],"algorithm":[136,184],"find":[138],"optimum":[140],"alignment(including":[141],"gaps)":[142],"sequences.":[145],"Dynamic":[146],"programming":[147],"ensure":[149],"optimal":[151],"by":[154],"exploring":[155],"all":[156],"possible":[157],"alignments":[158],"choosing":[160],"best.":[162],"will":[165],"p":[167],"vided":[168],"user-interface":[171],"giving":[173],"input":[175,226],"opting":[178],"required":[181],"algorithm.":[182],"uses":[185],"BLOSUM50":[187],"substitution":[188],"matrix":[189],"computation,":[191],"outputs":[193],"Functional":[195],"mat":[196],"ix(F-mat":[197],"ix),":[198],"Optimal":[199],"Alignment":[200],"score.":[203],"total":[205],"calculated":[209],"function":[212],"identity":[215],"aligned":[218],"residues":[219],"gap":[222],"penalties":[223],"incurred.":[224],"taken":[230],"from":[231],"file":[233],"stored":[234],"on":[235],"disk.":[237]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4413301048","counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2025-08-19T00:00:00"}
